CiteULike
Facebook
Mendeley
Twitter
This article is- freely available
- re-usable
Entropy 2010, 12(1), 34-52; doi:10.3390/e12010034
Review
Data Compression Concepts and Algorithms and Their Applications to Bioinformatics
Department of Electrical Engineering, University of Nebraska-Lincoln, NE 68588-0511, USA
* Author to whom correspondence should be addressed.
Received: 4 December 2009 / Accepted: 17 December 2009 / Published: 29 December 2009
Download PDF Full-Text [435 KB, uploaded 30 December 2009 08:27 CET]
Abstract: Data compression at its base is concerned with how information is organized in data. Understanding this organization can lead to efficient ways of representing the information and hence data compression. In this paper we review the ways in which ideas and approaches fundamental to the theory and practice of data compression have been used in the area of bioinformatics. We look at how basic theoretical ideas from data compression, such as the notions of entropy, mutual information, and complexity have been used for analyzing biological sequences in order to discover hidden patterns, infer phylogenetic relationships between organisms and study viral populations. Finally, we look at how inferred grammars for biological sequences have been used to uncover structure in biological sequences.
Keywords: bioinformatics; data compression; information theory
Article Statistics
Click here to load and display the download statistics.Cite This Article
MDPI and ACS Style
Nalbantoglu, Ö.U.; Russell, D.J.; Sayood, K. Data Compression Concepts and Algorithms and Their Applications to Bioinformatics. Entropy 2010, 12, 34-52.
AMA StyleNalbantoglu ÖU, Russell DJ, Sayood K. Data Compression Concepts and Algorithms and Their Applications to Bioinformatics. Entropy. 2010; 12(1):34-52.
Chicago/Turabian StyleNalbantoglu, Özkan U.; Russell, David J.; Sayood, Khalid. 2010. "Data Compression Concepts and Algorithms and Their Applications to Bioinformatics." Entropy 12, no. 1: 34-52.