Textual data compression in computational biology: Algorithmic techniques

Computer Science Review

Volumn 6, Issue 1, 2012, Pages 1-25

  Giancarlo, R ^a   Scaturro, D ^a   Utro, F ^b  

^a UNIVERSITY OF PALERMO   (Italy)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Algorithms; Alignment free sequence comparison; Bioinformatics; Data Compression Theory and Practice; Entropy; Hidden Markov Models; Huffman coding; Kolmogorov complexity; Lempel Ziv compressors; Minimum Description Length principle; Pattern discovery in bioinformatics; Reverse engineering of biological networks; Sequence alignment

Indexed keywords

EID: 84856608719     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2011.11.001     Document Type: Review

References (225)

1. Giancarlo R., Scaturro D., Utro F. Textual data compression in computational biology: a synopsis. Bioinformatics 2009, 25:1575-1586.
2. Nalbantoglu O.U., Russell D.J., Sayood K. Data compression concepts and algorithms and their applications to bioinformatics. Entropy 2010, 12:34-52.
3. Cohen J. Bioinformatics an introduction for computer scientists. ACM Computing Surveysl 2004, 36(2):122-158.
4. Leleu M., Lefebvre G., Rougemont J. Processing and analyzing ChIP-seq data: from short reads to regulatory interactions. Briefings in Functional Genomics 2010.
5. Pop M., Salzberg S.L. Bioinformatics challenges of new sequencing technology. Trends in Genetics 2008, 24:142-149.
6. Flicek P. The need for speed. Genome Biology 2009, 10:212.
7. Navarro G., Mäkinen V. Compressed full-text indexes. ACM Computing Surveys 2007, 39:2.
8. Grümbach S., Tahi F. Compression of DNA sequences. Proc. of the IEEE Data Compression Conference 1993, 340-350. IEEE Computer Society.
9. Grümbach S., Tahi F. A new challenge for compression algorithms: Genetic sequences. Information Processing & Management 1994, 30:875-886.
10. Cover T.M., Thomas J.A. Elements of Information Theory 1991, Wiley-Interscience, New York City.
11. Rissanen J., Langdon G.G. Arithmetic coding. IBM Journal of Research and Development 1979, 23:149-162.
12. Rivals É., Delahaye J.P., Dauchet M., Delgrange O. A guaranteed compression scheme for repetitive DNA sequences. Proc. of the IEEE Data Compression Conference 1996, 453. IEEE Computer Society.
13. Chen X., Kwong S., Li M. A compression algorithm for DNA sequences and its applications in genome comparison. RECOMB 00: Proc. of the 4th Annual International Conference on Computational Molecular Biology 2000, 107-117. ACM, New York.
14. Chen X., Li M., Ma B., Tromp J. DNACompress: fast and effective DNA sequence compression. Bioinformatics 2002, 18:1696-1698.
15. Apostolico A., Lonardi S. Some theory and practice of greedy off-line textual substitution. Proc. of the IEEE Data Compression Conference 1998, 119-128. IEEE Computer Society.
16. Matsumoto T., Sadakane K., Imai H. Biological sequence compression algorithms. Genome Informatics 2000, 11:43-52.
17. Benci V., Bonanno C., Galatolo S., Menconi G., Virgilio M. Dynamical systems and computable information. Discrete and Continuous Dynamical Systems. Series B 2004, 4:935-960.
18. Manzini G., Rastero M. A simple and fast DNA compressor. Software-Practice and Experience 2005, 35:1397-1411.
19. S. Bao, S. Chen, Z. Jing, R. Ren, A DNA sequence compression algorithm based on LUT and LZ77, CoRR http://abs/cs/0504100.
20. Behzadi B., Fessant F.L. DNA compression challenge revisited: a dynamic programming approach. CPM 2005, 190-200. Springer.
21. Tabus I., Korodi G., Rissanen J. DNA sequence compression using the normalized maximum likelihood model for discrete regression. Proc. of the IEEE Data Compression Conference 2003, 253-262. IEEE Computer Society.
22. Hategan A., Tabus I. Protein is compressible. Proc. of the 6th Nordic Signal Processing Symposium 2004, 192-195. IEEE Computer Society.
23. Korodi G., Tabus I. An efficient normalized maximum likelihood algorithm for DNA sequence compression. ACM Transactions on Information Systems 2005, 23:3-34.
24. Tembe W., Lowey J., Suh E. G-SQZ: compact encoding of genomic sequence and quality data. Bioinformatics 2010.
25. Cao M.D., Dix T.I., Allison L., Mears C. A simple statistical algorithm for biological sequence compression. Proc. of the IEEE Data Compression Conference 2007, 43-52. IEEE Computer Society.
26. Adjeroh D., Nan F. On compressibility of protein sequences. Proc. of the IEEE Data Compression Conference 2006, 422-434. IEEE Computer Society.
27. Adjeroh D., Zhang Y., Mukherjee A., Powell M., Bell T. DNA sequence compression using the Burrows-Wheeler transform. Proc. of the IEEE Computer Society Conference on Bioinformatics 2002, 303-313. IEEE Computer Society.
28. Burrows M., Wheeler D. A block-sorting lossless data compression algorithm. Digital Equipment Corporation 1994, Tech. Rep. 124.
29. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology 1997, Cambridge University Press, Cambridge.
30. Adjeroh D., Feng J. The SCP and compressed domain analysis of biological sequences. Proc. of the IEEE Computer Society Conference on Bioinformatics 2003, 587. IEEE Computer Society.
31. Ziv J., Lempel A. Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 1978, 24:530-536.
32. Kieffer J.C., Yang E.-H. Grammar-based codes: a new class of universal lossless source codes. IEEE Transactions on Information Theory 2000, 46:737-754.
33. Larsson N.J., Moffat A. Offline dictionary-based compression. Proc. of the IEEE Data Compression Conference 1999, 296-305. IEEE Computer Society.
34. Nevill-Manning C.G., Witten I.H. Compression and explanation using hierarchical grammars. The Computer Journal 1997, 40:103-116.
35. Cameron R.D. Source encoding using syntactic information source models. IEEE Transactions on Information Theory 1988, 34:843-850.
36. Cook C.M., Rosenfeld A., Aronson A.R. Grammatical inference by hill climbing. Information Sciences 1976, 10:59-80.
37. Marsh E., Sager N. Analysis and processing of compact text. Proc. of the 9th Conf. Computational Linguistics 1982, 201-206. J. Horecký.
38. Stolcke A., Omohundro S.M. Inducing probabilistic grammars by Bayesian model merging. Proc. of 2nd International Conference on Grammatical Inference, ICGI-94 1994, vol. 862:106-118. Springer-Verlag.
39. N. Cherniavsky, R. Ladner, Grammar-based compression of DNA sequences, in: DIMACS Working Group on the Burrows-Wheeler Transform, 2004.
40. Liu Q., Yang Y., Chen C., Bu J., Zhang Y., Ye X. RNACompress: grammar-based compression and informational complexity measurement of RNA secondary structure. BMC Bioinformatics 2008, 9:176+.
41. Higgs P.G. RNA secondary structure: physical and computational aspects. Journal Quarterly Reviews of Biophysics 2000, 33:199-253.
42. Korodi G., Tabus I. Compression of annotated nucleotide sequences. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2007, 4:447-457.
43. Storer J. Data Compression: Methods and Theory. Principles of Computer Science Series 1988, Computer Science Press, Rockville, MD.
44. Elias P. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 1975, 21:194-203.
45. Golomb S.W. Run length encoding. IEEE Transactions on Information Theory 1965, 12:399-401.
46. Huffman D.A. A Method for the Construction of Minimum-Redundancy Codes. IRE 1952, vol. 40:1098-1101.
47. Tichy W.F. RCSa system for version control. Software-Practice and Experience 1985, 15:637-654.
48. Brandon M.C., Wallace D.C., Baldi P. Data structures and compression algorithms for genomic sequence data. Bioinformatics 2009.
49. Daily K., Rigor P., Christley S., Xie X., Baldi P. Data structures and compression algorithms for high-throughput sequencing technologies. BMC Bioinformatics 2010, 11:514.
50. Christley S., Lu Y., Li C., Xie X. Human genomes as email attachments. Bioinformatics 2009, 25:274-275.
51. Buchsbaum A.L., Caldwell D.F., Church K.W., Fowler G.S., Muthukrishnan S. Engineering the compression of massive tables: An experimental approach. Proc. of the Symposium on Discrete Algorithms 2000, 175-184. ACM-SIAM.
52. Buchsbaum A.L., Fowler G.S., Giancarlo R. Improving table compression with combinatorial optimization. Journal of the ACM 2003, 50:825-851.
53. Vo B.D., Vo K.-P. Using column dependency to compress tables. Proc. of the IEEE Data Compression Conference 2004, 92-101. IEEE Computer Society.
54. Vo B.D., Vo K.-P. Compressing table data with column dependency. Theoretical Computer Science 2007, 387:273-283.
55. Apostolico A., Cunial F., Kaul V. Table compression by record intersection. Proc. of the IEEE Data Compression Conference 2008, 13-22. IEEE Computer Society.
56. Genome, 1000 genome project. Available at: , 2008. http://www.1000genomes.org/.
57. White W.T., Hendy M. Compressing DNA sequence databases with coil. BMC Bioinformatics 2008, 9:242.
58. Schneider T.D., Stormo G.D., Gold L., Ehrenfeucht A. Information content of binding sites on nucleotide sequences. Journal of Molecular Biology 1986, 188:415-431.
59. Gutell R.R., Power A., Hertz G.Z., Putz E.J., Stormo G.D. Identifying constraints on the higher-order structure of RNA: continued development and application of comparative sequence analysis methods. Nucleic Acids Research 1992, 20:5785-5795.
60. Li M., Vitányi P.M.B. An Introduction to Kolmogorov Complexity and its Application 1997, Springer-Verlag, New York City.
61. Bolshoy A. DNA sequence analysis linguistic tools: contrast vocabularies, compositional spectra and linguistic complexity. Applied Bioinformatics 2003, 2:103-112.
62. Konopka A.K. Information theories in molecular biology and genomics. Nature Encyclopedia of the Human Genome 2005, 3:464-469.
63. Lió P., Politi A., Buiatti M., Ruffo S. High statistics block entropy measures of DNA sequences. Journal of Theoretical Biology 1996, 180:151-160.
64. Benedetto D., Caglioti E., Chica C. Compressing proteomes: the relevance of medium range correlations. EURASIP Journal on Bioinformatics and Systems Biology 2007, 2007:1-8.
65. Loewenstern D., Yianilos P.N. Significantly lower entropy estimates for natural DNA sequences. Journal of Computational Biology 1999, 6:125-142.
66. Schmidt A.O., Herzel H. Estimating the entropy of DNA sequences. Journal of Theoretical Biology 1997, 188:369-377.
67. Weiss O., Herzel H. Correlations in protein sequences and property codes. Journal of Theoretical Biology 1998, 190:341-353.
68. Weiss O., Jiménez-Montaño M.A., Herzel H. Information content of protein sequences. Journal of Theoretical Biology 2000, 206:379-386.
69. Farach M., Noordewier M.O., Savari S.A., Shepp L.A., Wyner A.D., Ziv J. On the entropy of DNA: algorithms and measurements based on memory and rapid convergence. Proc. of the Symposium on Discrete Algorithms 1995, 48-57. ACM-SIAM.
70. Lempel A., Ziv J. On the complexity of finite sequences. IEEE Transactions on Information Theory 1976, 22:75-81.
71. Rodeh M., Pratt V.R., Even S. Linear algorithm for data compression via string matching. Journal of the ACM 1981, 28:16-24.
72. Lanctot J.K., Li M., Yang E. Estimating DNA sequence entropy. Proc. of the Symposium on Discrete Algorithms 2000, 409-418. ACM-SIAM.
73. Gusfield D. Suffix trees (and relatives) come of age in bioinformatics. Proc. of the IEEE Computer Society Conference on Bioinformatics 2002, 3. IEEE Computer Society.
74. Apostolico A. The myriad virtues of subword trees. NATO ISI Series 1985, 85-96. Springer-Verlag.
75. Ferragina P., González R., Navarro G., Venturini R. Compressed text indexes: from theory to practice!. ACM Journal of Experimental Algorithmics 2008.
76. Sadakane K. New text indexing functionalities of compressed suffix arrays. Journal of Algorithms 2003, 48:294-313.
77. Mäkinen V., Navarro G., Sirén J., Välimäki N. Storage and retrieval of highly repetitive sequence collections. Journal of Computational Biology 2010, 17:281-308.
78. Sadakane K., Shibyya T. Indexing huge genome sequences for solving various problems. Genome Informatics 2001, 12:175-183.
79. Healy J., Thomas E.E., Schwartz J.T., Wigler M. Annotating large genomes with exact word matches. Genome Research 2003, 13:2306-2315.
80. Ferragina P., Manzini G. Opportunistic data structures with applications. Proc. of the 41st IEEE Symposium on Foundations of Computer Science 2000, 390-398. IEEE Computer Society.
81. Lippert R.A., Mobarry C.M., Walenz B.P. A space-efficient construction of the Burrows-Wheeler transform for genomic data. Journal of Computational Biology 2005, 12:943-951.
82. Lippert R.A. Space-efficient whole genome comparisons with Burrows-Wheeler transforms. Journal of Computational Biology 2005, 12:407-415.
83. Välimäki N., Gerlach W., Dixit K., Mäkinen V. Compressed suffix tree-a basis for genome-scale sequence analysis. Bioinformatics 2007, 23:629-630.
84. Li H., Homer N. A survey of sequence alignment algorithms for next-generation sequencing. Briefings in Bioinformatics 2010, 11:473-483.
85. Langmead B., Trapnell C., Pop M., Salzberg S. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology 2009, 10:R25.
86. Li H., Durbin R. Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 2009, 25:1754-1760.
87. Li R., Yu C., Li Y., Lam T.-W., Yiu S.M., Kristiansen K., Wang J. SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics 2009, 25:1966-1967.
88. Strelets V.B., Lim H.A. Compression of protein sequence databases. Computer Applications in Biosciences (CABIOS) 1995, 11:557-561.
89. Time Wraps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison 1983, Addison-Wesley, Reading, Massachusetts. J.B. Kruskal, D. Sankoff (Eds.).
90. Waterman M.S. Introduction to Computational Biology. Maps, Sequences and Genomes 1995, Chapman & Hall, London.
91. Vinga S., Almeida J.S. Alignment-free sequence comparison: A review. Bioinformatics 2003, 19:513-523.
92. Brudno M., Do C., Cooper G., Kim M., Davydov E., Program N.C.S., Green E.D., Sidow A., Batzoglou S. LAGAN and multi-LAGAN: efficient tools for large-scale multiple alignment of genomic DNA. Genome Research 2003, 13:721-731.
93. Li M., Xin C., Li X., Ma B., Vitányi P.M.B. The similarity metric. IEEE Transactions on Information Theory 2003, 50:3250-3264.
94. Varré J.-S., Delahaye J.P., Rivals É. Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinformatics 1999, 15:194-202.
95. Lemaitre C., Sagot M.F. A small trip in the untranquil world of genomes-a survey on the detection and analysis of rearrangment breakpoints. Theoretical Computer Science 2008, 395:171-192.
96. Apostolico A. Maximal words in sequence comparisons based on subword composition. Lecture Notes in Computer Science 2010, vol. 6060:34-44. Springer, Berlin, Heidelberg. T. Elomaa, H. Mannila, P. Orponen (Eds.).
97. Epifanio C., Giancarlo R., Gabriele A., Sciortino M. Novel combinatorial and information theoretic alignment-free distances for biological data mining. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications 2010, 323-357. John Wiley and Sons, New York. M. Elloumi, A. Zomaya (Eds.).
98. Kemena C., Notredame C. Upcoming challenges for multiple sequence alignment methods in the high-throughput era. Bioinformatics 2009, 25:2455-2465.
99. Kertesz-Farkas A., Kocsor A., Pongor S. The application of data compression-based distances to biological sequences. Information Theory and Statistical Learning 2009, 83-100. Springer. F. Emmert-Streib, M. Dehmer (Eds.).
100. Keogh E., Lonardi S., Rtanamahata C. Towards parameter-free data mining. Proc. of 10th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining 2004, 206-215. ACM, New York.
101. Keogh E., Keogh L., Handley J.C. Compression-based data mining. Encyclopedia of Data Warehousing and Mining 2008, 278-285. IGI-Global, Hershley, PA. J. Wang (Ed.).
102. Otu H.H., Sayood K. A new sequence distance measure for phylogenetic tree construction. Bioinformatics 2003, 19:2122-2130.
103. Zhang Y., Hao J., Zhou C., Chang K. Normalized Lempel-Ziv complexity and its application in bio-sequence analysis. Journal of Mathematical Chemistry 2009, 46:1203-1212.
104. Bennett C.H., Gács P., Li M., Vitányi P.M.B., Zurek W. Information distance. IEEE Transactions on Information Theory 1998, 44:1407-1423.
105. Cilibrasi R., Vitányi P.M.B. Clustering by compression. IEEE Transactions on Information Theory 2005, 51:1523-1545.
106. Ferragina P., Giancarlo R., Greco V., Manzini G., Valiente G. Compression-based classification of biological sequences and structures via the universal similarity metric: experimental assessment. BMC Bioinformatics 2007, 8:252.
107. Shkarin D. PPM: one step to practicality. Proc. of the IEEE Data Compression Conference 2002, 202-211. IEEE Computer Society.
108. Apostolico A., Comin M., Parida L. Mining, compressing and classifying with extensible motifs. Algorithms for Molecular Biology 2006, 1:4.
109. Bastola D.R., Otu H.H., Doukas S.E., Sayood K., Hinrichs S.H., Iwen P.C. Utilization of the relative complexity measure to construct a phylogenetic tree for fungi. Mycological Research 2004, 108:117-125.
110. Li M., Badger J.H., Chen X., Kwong S., Kearney P.E., Zhang H. An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics 2001, 17:149-154.
111. Rivals É., Dauchet M., Delahaye J.P., Delgrange O. Compression and genetic sequences analysis. Biochimie 1996, 78:315-322.
112. Rodrigo A., Bertels F., Heled J., Noder R., Shearman H., Tsai P. The perils of plenty: what are we going to do with all these genes?. Philosophical Transactions of the Royal Society of London. Series B, Biological Sciences 2008, 3893-3902.
113. Weeks K., Chuzhanova N., Donnison I., Scott I. Evolutionary hierarchies of conserved blocks in 5'-noncoding sequences of dicot rbcS genes. BMC Evolutionary Biology 2007, 7:51.
114. Wheeler D.L., Barrett T., Benson D.A., Bryant S.H., Canese K., Chetvernin V., Church D.M., Cuccio M.D., Edgar R., Federhen S., Geer L.Y., Helmberg W., Kapustin Y., Kenton D.L., Khovayko O., Lipman D.J., Madden T.L., Maglott D.R., Ostell J., Pruitt K.D., Schuler G.D., Schriml L.M., Sequeira E., Sherry S.T., Sirotkin K., Souvorov A., Starchenko G., Suzek T.O., Tatusov R., Tatusova T.A., Wagner L., Yaschenko E. Database resources of the national center for biotechnology information. Nucleic Acids Research 2000, 28:10-14.
115. Albayrak A., Otu H., Sezerman U. Clustering of protein families into functional subtypes using relative complexity measure with reduced amino acid alphabets. BMC Bioinformatics 2010, 11:428.
116. Gilbert D., Rosselló F., Valiente G., Veeramalai M. Alignment-free comparison of TOPS strings. Proc. of London Algorithmics and Stringology 2007, 177-197. College Publications.
117. Kocsor A., Kartesz-Farkas A., Kajan L., Pongor S. Application of compression-based distance measures to protein sequence classification: a methodological study. Bioinformatics 2005, 22:407-412.
118. Krasnogor N., Pelta D.A. Measuring the similarity of protein structures by means of the universal similarity metric. Bioinformatics 2004, 20:1015-1021.
119. Liu N., Wang T. Protein-based phylogenetic analysis by using hydropathy profile of amino acids. FEBS Letters 2006, 580:5321-5327.
120. Liu L., Wang T. Comparison of TOPS strings based on LZ complexity. Journal of Theoretical Biology 2008, 251:159-166.
121. Pelta D.A., Gonzales J.R., Krasnogor N. Protein structure comparison through fuzzy contact maps and the universal similarity metric. Proc. of the Joint 4th EUSFLAT & 11th LFA Conference 2005, 1124-1129. Universitat Politécnica de Catalunya.
122. F. Rosselló, J. Rocha, J. Segura, Compression ratios based on the universal similarity metric still yield protein distances far from CATH distances. CoRR http://abs/q-bio/0603007.
123. Pearl F., Todd A., Sillitoe I., Dibley M., Redfern O., Lewis T., Bennett C., Marsden R., Grant A., Lee D., Akpor A., Maibaum M., Harrison A., Dallman T., Reeves G., Diboun I., Addou S., Lise S., Johnston C., Sillero A., Thornton J., Orengo C. The CATH domain structure database and related resources Gene3D and DHS provide comprehensive domain family information for genome analysis. Nucleic Acids Research 2005, 33:D247-D251.
124. Barthel D., Hirst J.D., Blażewicz J., Burke E.K., Kransnogor N. ProCKSI: a decision support system for protein (structure) comparison, knowledge, similarity and information. BMC Bioinformatics 2008, 8:416.
125. Otu H.H., Sayood K. A divide-and-conquer approach to fragment assembly. Bioinformatics 2003, 19:22-29.
126. Galas D.J., Nykter M., Carter G.W., Price N.D., Shmulevich I. Biological information as set-based complexity. IEEE Transactions on Information Theory 2010, 56:667-677.
127. D.J. Galas, M. Nykter, G.W. Carter, N.D. Price, I. Shmulevich, Set-based complexity and biological information. CoRR http://abs/0801.4024.
128. Durbin R., Sean E.R., Krogh A., Mitchison G. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids 1999, Cambridge University Press, Cambridge.
129. Smith T., Waterman M. Identification of common molecular subsequences. Journal of Molecular Biology 1981, 147:195-197.
130. Altshul S.F., Gish W., Miller W., Myers E.W., Lipman D.J. Basic local alignment search tool. Journal of Molecular Biology 1990, 215:403-410.
131. Viterbi A.J. Error bounds for convolution codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 1967, 13:260-269.
132. Buchsbaum A.L., Giancarlo R. Algorithmic aspects in speech recognition: an introduction. ACM Journal of Experimental Algorithmics 1997, 2:1.
133. Crochemore M., Landau G., Ziv-Ukelson M. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. SIAM Journal on Computing 2003, 32:1654-1673.
134. Giancarlo R. Dynamic programming: special cases. Pattern Matching Algorithms 1997, 201-236.
135. Mozes S., Weimann O., Ziv-Ukelson M. Speeding up HMM decoding and training by exploiting sequence repetitions. Proc. 18th Annual Symposium on Combinatorial Pattern Matching 2007, 4-15. Springer-Verlag.
136. Gabriel S., Schaffner S., Nguyen H., Moore J., Roy J., Blumenstiel B., Higgins J., DeFelice M., Lochner A., Faggart M., Liu-Cordero S.N., Rotimi C., Adeyemo A., Cooper R., Ward R., Lander E.S., Daly M.J., Altshuler D. The structure of haplotype blocks in the human genome. Science 2002, 26:2225-2229.
137. Patil N., Berno A.J., Hinds D.A., Barrett W.A., Doshi J.M., Hacker C.R., Kautzer C.R., Lee D.H., Marjoribanks C., McDonough D.P., Nguyen B.T., Norris M.C., Sheehan J.B., Shen N., Stern D., Stokowski R.P., Thomas D.J., Trulson M.O., Vyas K.R., Frazer K.A., Fodor S.P., Cox D.R. Blocks of limited haplotype diversity revealed by high-resolution scanning of human chromosome 21. Science 2001, 294:1719-1723.
138. Anderson E.C., Novembre J. Finding haplotype block boundaries by using the Minimum-Description-Length principle. The American Journal of Human Genetics 2003, 73:336-354.
139. Bockhorst J., Jojic N. Discovering patterns in biological sequences by optimal segmentation. Proc. of the 23rd Conference in Uncertainty in Artificial Intelligence 2007, 17-24. AUAI Press.
140. Daly M.J., Rioux J.D., Schaffner S.F., Hudson T.J., Lander E.S. High-resolution haplotype structure in the human genome. Nature Genetics 2001, 29:229-232.
141. Koivisto M. An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries. Proc. of the Pacific Symposium on Biocomputing 2003, 502-513. World Scientific.
142. Zhang K., Deng M., Chen T., Waterman M.S., Sun F. A dynamic programming algorithm for haplotype block partitioning. Proceedings of the National Academy of Sciences of the United States of America 2002, 7335-7339.
143. Barron A.R., Rissanen J., Yu B. The Minimum Description Length principle in coding and modeling. IEEE Transactions on Information Theory 1998, 44:2743-2760.
144. Grünwald P.D. Minimum Description Length tutorial. Advances in Minimum Description Length: Theory and Applications 2005, 23-80. MIT Press, Cambridge. P.D. Grünwald, I.J. Myung, M.A. Pitt (Eds.).
145. Vitányi P.M.B., Li M. Minimum Description Length induction, Bayesianism, and Kolmogorov complexity. IEEE Transactions on Information Theory 2000, 46:446-464.
146. Parida L. Pattern Discovery in Bioinformatics Theory & Algorithms 2007, Chapman & Hall, CRC Taylor & Francis Group, New York.
147. Reinert G., Schbath S., Waterman M. Statistics on words with applications to biological sequences. Encyclopedia of Mathematics and its Applications 2005, vol. 105:252-323. Cambridge University Press. M. Lotaire (Ed.).
148. Ferreira P.G., Azevedo P.J. Evaluating protein motif significance measures: a case study on prosite patterns. Proc. of the Computational Intelligence and Data Mining 2007, 34-43. IEEE Computer Society.
149. Milosavljevic A., Jurka J. Discovering simple DNA sequences by the algorithmic significance method. Computer Applications in the Biosciences 1993, 9:407-411.
150. Milosavljevic A. Discovering dependencies via algorithmic mutual information: A case study in DNA sequence comparisons. Machine Learning 1995, 21:35-50.
151. Powell D.R., Dowe D.L., Allison L., Dix T.I. Discovering simple DNA sequences by compression. Proc. of the Pacific Symposium on Biocomputing 1998, 597-608. World Scientific.
152. Aktulga H.M., Kontoyiannis I., Lyznik L.A., Szpankowski L., Grama A.Y., Szpankowski W. Identifying statistical dependence in genomic sequences via mutual information estimates. EURASIP Journal on Bioinformatics and Systems Biology 2007, 2007:1-11.
153. Apostolico A., Bock M.E., Lonardi S. Monotony of surprise and large-scale quest for unusual words. Journal of Computational Biology 2003, 10:283-311.
154. Brazma A., Jonassen I., Ukkonen E., Vilo J. Discovering patterns and subfamilies in biosequences. Proc. of the 4th International Conference on Intelligent Systems for Molecular Biology 1996, 34-43. AAAI Press.
155. Q. Ma, J.T.L. Wang, Evaluating the significance of sequence motifs by the Minimum Description Length principle, 2000.
156. Nevill-Manning C.G., Sethi K.S., Wu T.D., Brutlag D.L. Enumerating and ranking discrete motifs. Proc. of the 5th International Conference on Intelligent Systems for Molecular Biology 1997, 202-209. AAAI Press.
157. Chvátal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research 1979, 4:233-235.
158. Jonassen I. Efficient discovery of conserved patterns using a pattern graph. Computer Applications in the Biosciences 1997, 13:509-522.
159. Apostolico A., Comin M., Parida L. Motifs in Ziv-Lempel-Welch clef. Proc. of the IEEE Data Compression Conference 2004, 72-81. IEEE Computer Society.
160. Apostolico A., Comin M., Parida L. Bridging lossy and lossless compression by motif pattern discovery. General Theory of Information Transfer and Combinatorics 2006, 4123:793-813.
161. Sharan R., Ideker T. Modeling cellular machinery through biological network comparison. Nature Biotechnology 2006, 24:427-433.
162. Zhang S., Zhang X.-S., Chen L. Biomolecular network querying: a promising approach in systems biology. BMC Systems Biology 2008, 2:5.
163. Margolin A.A., Nemenman I., Basso K., Wiggins C., Stolovitzky G., Dalla Favera R., Califano A. ARACNEa: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinformatics 2006, 7(Suppl. 1):S7.
164. Butte A.J., Kohane I.S. Unsupervised knowledge discovery in medical databases using relevance networks. Proc. of the AMIA Symposium 1999, 711-715. Hanley and Belfus.
165. Butte A.J., Kohane I.S. Mutual information relevance networks: functional genomic clustering using pairwise entropy measurements. Proc. of the Pacific Symposium on Biocomputing 2000, 415-426. World Scientific.
166. Butte A.J., Tamayo P., Slonim D., Golub T.R., Kohane I.S. Discovering functional relationships between RNA expression and chemotherapeutic susceptibility using relevance networks. Proceedings of the National Academy of Sciences of the United States of America 2000, 12182-12186.
167. A. Margolin, N. Banerjee, I. Nemenman, A. Califano, Reverse engineering of the yeast transcriptional network using the ARACNE algorithm, Manuscript.
168. Meyer P.E., Kontos K., Lafitte F., Bontempi G. Information-theoretic inference of large transcriptional regulatory networks. EURASIP Journal on Bioinformatics and Systems Biology 2007, 2007:8.
169. Chor B., Tuller T. Biological networks: Comparison, conservation, and evolution via relative description length. Journal of Computational Biology 2007, 14:817-834.
170. Kanehisa M., Goto S. KEGG: kyoto encyclopedia of genes and genomes. Nucleic Acids Research 2000, 28:27-30.
171. NCBI, NCBI taxonomy database. Available at: , 2007. http://www.ncbi.nlm.nih.gov/entrez/linkout/tutorial/taxtour.html.
172. Sculley D., Brodley C. Compression of DNA sequences. Compression and Machine Learning: A New Perspective on Feature Space Vectors 2006, IEEE Computer Society, pp. 332-332.
173. Hood L., Galas D. The digital code of DNA. Nature 2003, 421:444-448.
174. Ron D., Singer Y. The power of amnesia: learning probabilistic automata with variable memory length. Machine Learning 1996, 117-149. Springer, Netherlands.
175. Bejerano G., Yona G. Variations on probabilistic suffix trees: statistical modeling and prediction of protein families. Bioinformatics 2001, 17:23-43.
176. Apostolico A., Bejerano G. Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. RECOMB'00: Proceedings of the 4th Annual International Conference on Computational Molecular Biology 2000, 25-32. ACM.
177. Schulz M.H., Weese D., Rausch T., Döring A., Reinert K., Vingron M. Fast and adaptive variable order Markov chain construction. Proceedings of the 8th International Workshop on Algorithms in Bioinformatics 2008, 306-317. Springer-Verlag.
178. Ziv J. On finite memory universal data compression and classification of individual sequences. IEEE Transactions on Information Theory 2008, 54:1626-1636.
179. Handl J., Knowles J., Kell D.B. Computational cluster validation in post-genomic data analysis. Bioinformatics 2005, 21(15):3201-3212.
180. M. Nykter, O. Yli-Harja, I. Shmulevich, Normalized compression distance for gene expression analysis, in: Proceedings of GENSIPS IEEE International Workshop on Genomic Signal Processing and Statistics, IEEE, 2005, pp. 2-3.
181. Zhou X., Wang X., Dougherty E., Russ D., Suh E. Gene clustering based on clusterwide mutual information. Journal of Computational Biology 2004, 11:147-161.
182. Giancarlo R., Lo Bosco G., Pinello L. Distance functions, clustering algorithms and microarray data analysis. Lecture Notes in Computer Science 2010, vol. 6073.
183. R. Giancarlo, G. Lo Bosco, L. Pinello, F. Utro, The three steps of clustering in the post-genomic era: a synopsis, in: Proc. of CIBB, in: Lecture Notes in Computer Science, 2011, pp. 13-30.
184. Peng H., Long F., Ding C. Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy. IEEE Transactions on Pattern Analysis and Machine Intelligence 2005, 27:1226-1238.
185. Zhou W., Zhou C., Liu G., Zhu H. Feature selection for microarray data analysis using mutual information and rough set theory. IFIP International Federation for Information Processing 2007, vol. 204:916-927. Springer, Boston.
186. Wang H., Perng C., Fan W.W., Yu P. An index structure for pattern similarity searching in DNA microarray data. Proceedings of the IEEE Computer Society Conference on Bioinformatics 2002, 256. IEEE Computer Society.
187. Salzberg S., Searls D., Kasif S. Computational Methods in Molecular Biology 1998, Elsevier Science, Amsterdam.
188. Szpankowski W., Ren W., Szpankowski L. An optimal DNA segmentation based on the MDL principle. Proc. of the IEEE Computer Society Conference on Bioinformatics 2003, 541-546. IEEE Computer Society.
189. Ziv J. On classification with empirically observed statistics and universal data compression. IEEE Transactions on Information Theory 1988, 34:278-286.
190. Shamir G.I., Costello D.J., Merhav N. Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources. IEEE Transactions on Information Theory 2000, 46:2244-2467.
191. Menconi G., Marangoni R. A compression-based approach for coding sequences identification in prokaryotic genomes. Journal of Computational Biology 2006, 13:1477-1488.
192. Menconi G. Sublinear growth of information in DNA sequences. Bulletin of Mathematical Biology 2004, 67:737-759.
193. Madsen B.E., Villesen P., Wiuf C. Short tandem repeats in human exons: a target for disease mutations. BMC Genomics 2008, 9:410+.
194. Rivals É., Delgrange O., Delahaye J.P., Dauchet M., Delorme M.O., Henaut A., Ollivier E. Detection of significant patterns by compression algorithms: The case of approximate tandem repeats in DNA sequences. Computer Applications in the Biosciences 1997, 13:131-136.
195. Allison L., Edgoose T., Dix T.I. Compression of strings with approximate repeats. Proc. of Intelligent Systems in Molecular Biology 1998, 8-16. AAAI Press.
196. Dix T.I., Powell D.R., Allison L., Bernal J., Jaeger S., Stern L. Comparative analysis of long DNA sequences by per element information content using different contexts. BMC Bioinformatics 2007, 8(Suppl. 2):S10.
197. Modegi T. Development of fast tandem repeat analysis and lossless compression method for DNA sequence. Proc. of Genome Informatics Workshop 2004, P088. Universal Academy Press, Tokyo.
198. Stern L., Allison L., Dix T.I. Discovering patterns in plasmodium falciparum genomic DNA. Molecular & Biochemical Parasitology 2001, 118:175-186.
199. Allison L., Stern L., Edgoose T., Dix T.I. Sequence complexity for biological sequence analysis. Computers & Chemistry 1992, 24:43-55.
200. Review, Nature reviews collection on microRNAs, Nature Review. doi:10.1038/nrg2202.
201. Evans S.C., Kourtidis A., Markham T.S., Miller J., Conklin D.S., Torres A.S. MicroRNA target detection and analysis for genes related to breast cancer using MDLcompress. EURASIP Journal on Bioinformatics and Systems Biology 2007, 2007:1-16.
202. D. Loewenstern, H. Hirsh, P.N. Yianilos, M. Noordewier, DNA sequence classification using compression-based induction, Tech. Rep., DIMACS, 1995.
203. J. Abel, Data compression web site. , 2002. http://www.data-compression.info/.
204. M. Mahoney, Data compression programs. , 2008. http://www.cs.fit.edu/~mmahoney/compression/.
205. G. Manzini, M. Rastero, DNA corpus. , 2005. http://www.mfn.unipmn.it/~manzini/dnacorpus/index.html.
206. Nevill-Manning G.C., Witten I.H. Protein is incompressible. Proc. of the IEEE Data Compression Conference 1999, 257-266. IEEE Computer Society.
207. M.D. Cao, T.I. Dix, L. Allison, C. Mears, XM software. , 2007. http://www.csse.monash.edu.au/~lloyd/tildeStrings/Compress/2007DCC/.
208. Bioinformatics Solutions, Bioinformatics solutions web site. , 2003. http://www.bioinformaticssolutions.com/products/ph/.
209. G. Fowler, Pzip home page. , 2003. http://www.research.att.com/~gsf/man/man1/pzip.html.
210. K.-P. Vo, Vcodex home page. , 2002. http://www.research.att.com/~gsf/download/ref/vcodex/vcodex.html.
211. M.C. Brandon, D.C. Wallace, P. Baldi, ProjectDNACompression home page. , 2009. http://www.mitomap.org/MITOWIKI/ProjectDNACompression.
212. S. Christley, Y. Lu, C. Li, X. Xie, DNAzip home page. , 2010. http://www.ics.uci.edu/~xhx/project/DNAzip.
213. Li H., Handsaker B., Wysoker A., Fennell T., Ruan J., Homer N., Marth G., Abecasis G., Durbin R. GPDP subgroup the sequence alignment/map format and SAMtools. Bioinformatics 2009, 25:2078-2079.
214. W. Tembe, J. Lowey, E. Suh, G-SQZ home page. , 2010. http://public.tgen.org/sqz.
215. D. Loewenstern, P.N. Yianilos, CDNA home page. , 1999. http://pnylab.com/pny/software/cdna/main.html.
216. R.A. Lippert, C.M. Mobarry, B.P. Walenz, Binary BWT. , 2005. http://math.mit.edu/~lippert/software/bbbwt/.
217. N. Välimäki, W. Gerlach, K. Dixit, V. Mäkinen, SuDS genome browser. , 2008. http://www.cs.helsinki.fi/group/suds/cst/.
218. P. Ferragina, R. González, G. Navarro, R. Venturini, Pizza & Chili home page. , 2008. http://pizzachili.dcc.uchile.cl/.
219. P. Ferragina, R. Giancarlo, V. Greco, G. Manzini, G. Valiente, Kolmogorov library home page. , 2007. http://www.math.unipa.it/~raffaele/kolmogorov/.
220. R. Cilibrasi, A.L. Cruz, S. de Rooij, M. Keijzer, CompLearn home page. , 2005. http://www.complearn.org/.
221. Gusev D.V., Nemytikova A.L., Chuzhanova A.N. On the complexity measures of genetic sequences. Bioinformatics 1999, 15:994-999.
222. J.-S. Varré, J.P. Delahaye, É. Rivals, The trasformation distance home page. , 1999. http://www.lifl.fr/~varre/TD/td.html.
223. M. Crochemore, S.A. de Carvalho Jr., Sourceforge web site. , 2003. http://neobio.sourceforge.net/.
224. Y. Lifshits, S. Mozes, O. Weimann, M. Ziv-Ukelson, Speeding up HMM decoding and training by exploiting sequence repetitions. , 2008. http://www.cs.brown.edu/~shay/hmmspeedup/hmmspeedup.html.
225. A.A. Margolin, K. Wang, W.K. Lim, M. Kustagi, I. Nemenman, A. Califano, ARACNE home page. , 2006. http://amdec-bioinfo.cu-genome.org/html/ARACNE.htm.