Data Compression Concepts and Algorithms and Their Applications to Bioinformatics

Creative Commons License

Nalbantoglu O. U., Russell D. J., Sayood K.

ENTROPY, cilt.12, sa.1, ss.34-52, 2010 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Derleme
  • Cilt numarası: 12 Sayı: 1
  • Basım Tarihi: 2010
  • Doi Numarası: 10.3390/e12010034
  • Dergi Adı: ENTROPY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.34-52
  • Erciyes Üniversitesi Adresli: Hayır

Özet

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.