Textual data compression in computational biology: A synopsis

Bioinformatics

Volumn 25, Issue 13, 2009, Pages 1575-1586

  Giancarlo, Raffaele ^a   Scaturro, Davide ^a   Utro, Filippo ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DNA; MICRORNA;

AUTOMATION; CLUSTER ANALYSIS; COMPUTER PROGRAM; DATA BASE; DATA MINING; DNA DETERMINATION; DNA SEQUENCE; GENE REGULATORY NETWORK; GENE SEQUENCE; GENE TARGETING; GENETIC ALGORITHM; GENETIC CODE; GENOME ANALYSIS; HAPLOTYPE; HIDDEN MARKOV MODEL; HUMAN; INFORMATION PROCESSING; INFORMATION STORAGE; INTERMETHOD COMPARISON; MATHEMATICAL ANALYSIS; MICROARRAY ANALYSIS; NONHUMAN; PRIORITY JOURNAL; PROBABILITY; QUALITY CONTROL; REVIEW; SEQUENCE ALIGNMENT; SINGLE NUCLEOTIDE POLYMORPHISM; TANDEM REPEAT; WEB BROWSER;

COMPUTATIONAL BIOLOGY; DATABASES, FACTUAL; INFORMATION STORAGE AND RETRIEVAL; SOFTWARE;

EID: 67649170975     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btp117     Document Type: Review

References (167)

1. Adami,C. (2004) Information theory in molecular biology. Phys. Life Rev., 1, 3-22.
2. Adjeroh,D. and Nan,F. (2006) On compressibility of protein sequences. In Proceedings of the IEEE Data Compression Conference (DCC), IEEE Computer Society, pp. 422-434.
3. Adjeroh,D. et al. (2002) DNA sequence compression using the Burrows-Wheeler transform. In Proceedings of the IEEE Computer Society Conference on Bioinformatics. IEEE Computer Society, pp. 303-313.
4. Aktulga,H.M. et al. (2007) Identifying statistical dependence in genomic sequences via mutual information estimates. EURASIP J. Bioinform. Syst. Biol., 2007, 1-11.
5. Allison,L. andYee,C.N. (1990) Minimum message length encoding and the comparison of macromolecules. Bull. Math. Biol., 52, 431-453.
6. Allison,L. et al. (1992) Sequence complexity for biological sequence analysis. Comput. Chem., 24, 43-55.
7. Allison,L. et al. (1998) Compression of strings with approximate repeats. In Proceedings of Intelligent Systems in Molecular Biology (ISMB98). AAAI Press, pp. 8-16.
8. Altshul,S.F. et al. (1990) Basic local alignment search tool. J. Mol. Biol., 215, 403-410.
9. Anderson,E.C. and Novembre,J. (2003) Finding haplotype block boundaries by using the minimum-description-length principle. Am. J. Hum. Genet. 73, 336-354.
10. Apostolico,A. (1985) Themyriad virtues of subword trees. In Combinatorial Algorithms on Words, NATO ISI Series (1985). Springer-Verlag, pp. 85-96.
11. Apostolico,A. and Bejerano,G. (2000) Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. In RECOMB '00: Proceedings of the 4th Annual International Conference on Computational Molecular Biology. ACM, pp. 25-32.
12. Apostolico,A. and Lonardi,S. (1998) Some theory and practice of greedy off-line textual substitution. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 119-128.
13. Apostolico,A. et al. (2006) Mining, compressing and classifying with extensible motifs. Alg. Mol. Biol., 1, 4.
14. Apostolico,A. et al. (2008) Table compression by record intersection. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 13-22.
15. Bao,S. et al. (2005) A DNA sequence compression algorithm based on LUT and LZ77. CoRR, abs/cs/0504100.
16. Barron,A.R. et al. (1998) The minimum description length principle in coding and modeling. IEEE Trans. Inform. Theory, 44, 2743-2760.
17. Basso,K. et al. (2003) Reverse engineering of regulatory networks in human B cells. Nat. Genet., 37, 382-390.
18. Behzadi,B. and Fessant,F.L. (2005) DNA compression challenge revisited: a dynamic programming approach. In CPM, Springer, pp. 190-200.
19. Bejerano,G. and Yona,G. (2001) Variations on probabilistic suffix trees: statistical modeling and prediction of protein families. Bioinformatics, 17, 23-43.
20. Benci,V. et al. (2004) Dynamical systems and computable information. Discrete Contin. Dyna. Syst. B, 4, 935-960.
21. Benedetto,D. et al. (2007) Compressing proteomes: The relevance of medium range correlations. EURASIP J. Bioinform. Syst. Biol., 2007, 1-8.
22. Bernaola-Galván,P. et al. (1996) Compositional segmentation and long-range fractal correlations in DNA sequences. Phys. Rev. E, 53, 5181-5189.
23. Bernaola-Galván,P. et al. (1999) Decomposition of DNA sequence complexity. Phys. Rev. Lett., 83, 3336-3339.
24. Bernaola-Galván,P. et al. (2000) Finding borders between coding and noncoding DNA regions by an entropic segmentation method. Phys. Rev. Lett., 85, 1342-1345.
25. Bird,A.P. (1987) GpC-rich islands as gene markers in the vertebrate nucleus. Trends Genet., 3, 342-347.
26. Bockhorst,J. and Jojic,N. (2007) Discovering patterns in biological sequences by optimal segmentation. In Proceedings of the 23rd Conference in Uncertainty in Artificial Intelligence. AUAI Press, in press.
27. Bolshoy,A. (2003) DNA sequence analysis linguistic tools: Contrast vocabularies, compositional spectra and linguistic complexity. Appl. Bioinform., 2, 103-112.
28. Brāzma,A. et al. (1996) Discovering patterns and subfamilies in biosequences. In Proceedings of the 4th International Conference on Intelligent Systems for Molecular Biology. AAAI press, pp. 34-43.
29. Buchsbaum,A.L. and Giancarlo,R. (1997) Algorithmic aspects in speech recognition: An introduction. ACM J. Exp. Alg., 2, 1.
30. Buchsbaum,A.L. et al. (2000) Engineering the compression of massive tables: An experimental approach. In SODA 00: Proceedings of the Symposium on Discrete Algorithms. ACM-SIAM, pp. 175-184.
31. Buchsbaum,A.L. et al. (2003) Improving table compression with combinatorial optimization. J. ACM, 50, 825-851.
32. Burrows,M. and Wheeler,D. (1994) A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation.
33. Butte,A.J. and Kohane,I.S. (1999) Unsupervised knowledge discovery in medical databases using relevance networks. In Proceedings of the AMIA Symposium. Hanley and Belfus, pp. 711-715.
34. Butte,A.J. and Kohane,I.S. (2000) Mutual information relevance networks: functional genomic clustering using pairwise entropy measurements. In Proceedings of the Pacific Symposium on Biocomputing (PSB). World Scientific, pp. 415-426.
35. Butte,A.J. et al. (2000) Discovering functional relationships between RNA expression and Chemotherapeutic susceptibility using relevance networks. In Proc. Natl Acad. Sci. USA, 12182-12186.
36. Cao,M.D. et al. (2007) A simple statistical algorithm for biological sequence compression. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 43-52.
37. Carothers,J. et al. (2004) Informational complexity and functional activity of RNA structures. J. Am. Chem. Soc., 126, 5130-5137.
38. Chen,X. et al. (2000) A compression algorithm for DNA sequences and its applications in genome comparison. In RECOMB 00: Proceedings of the 4th Annual International Conference on Computational Molecular Biology. ACM, New York, pp. 107-117.
39. Chen,X. et al. (2002) DNACompress: Fast and effective DNA sequence compression. Bioinformatics, 18, 1696-1698.
40. Cherniavsky,N. and Ladner,R. (2004) Grammar-based compression of DNA sequences. In DIMACS Working Group on The Burrows-Wheeler Transform
41. Chor,B. and Tuller,T. (2007) Biological networks: Comparison, conservation, and evolutionary via relative description length. J. Comput. Biol., 14, 817-834.
42. Cilibrasi,R. and Vitányi,P.M.B. (2005) Clustering by compression. IEEE Trans. Inform. Theory, 51, 1523-1545.
43. Cover,T.M. and Thomas,J.A. (1991) Elements of Information Theory. Wiley-Interscience, New York City.
44. Crochemore,M. and Vérin,R. (1999) Zones of low entropy in genomic sequence. Comput. Chem., 23, 275-282.
45. Crochemore,M. et al. (2003) A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. SIAM J. Comput., 32 1654-1673.
46. Daly,M.J. et al. (2001) High-resolution haplotype structure in the human genome. Nat. Genet., 29, 229-232.
47. Dix,T.I. et al. (2007) Comparative analysis of long DNA sequences by per element information content using different contexts. BMC Bioinformatics, 8(Suppl. 2), s10.
48. Durbin,R. et al. (1999) Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge.
49. Evans,S.C. et al. (2007) MicroRNA target detection and analysis for genes related to breast cancer using MDLcompress. EURASIP J. Bioinform. Syst. Biol., 2007, 1-16.
50. Farach,M. et al. (1995) On the entropy of DNA: Algorithms and measurements based on memory and rapid convergence. In SODA 95: Proceedings of the Symposium on Discrete Algorithms. ACM-SIAM, pp. 48-57.
51. Ferragina,P. et al. (2007) Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment. BMC Bioinformatis, 8, 252.
52. Ferragina,P. et al. (2008) Compressed text indexes: From theory to practice. ACM J. Exp. Alg., 13.
53. Ferreira,P.G. and Azevedo,P.J. (2007) Evaluating protein motif significance measures: A case study on prosite patterns. In Proceedings of the Computational Intelligence and Data Mining (CIDM . IEEE Computer Society, pp. 34-43.
54. Gabriel,S. et al. (2002) The structure of haplotype blocks in the human genome. Science, 26, 2225-2229.
55. Galas,D.J. et al. (2008) Set-based complexity and biological information. CoRR, abs/0801.4024.
56. Gatlin,L.L. (1972) Information Theory and the Living System. Columbia University Press, New York City.
57. Giancarlo,R. (1997). Dynamic programming: Special cases. In Apostolico,A. and Galil,Z. (eds), Pattern Matching Algorithms. Oxford University Press, pp. 201-236.
58. Gilbert,D. et al. (2007) Alignment-free comparison of TOPS strings. In Proceedings of London Algorithmics and Stringology. College Publications, pp. 177-197.
59. Godfrey-Smith,P. and Sterelny,K. (2008) Biological information. In The Stanford Encyclopedia of Philosophy. Stanford University Press.
60. Greenspan,G. and Geiger,D. (2003) Model-based inference of haplotype block variation. In RECOMB 03: In Proceedings of the 7th Annual International Conference on Research in Computational Molecular Biology ACM, New York, pp. 131-137.
61. Grümbach,S. and Tahi,F. (1993) Compression of DNA sequences. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 340-350.
62. Grümbach,S. and Tahi,F. (1994) A new challenge for compression algorithms: Genetic sequences. Inform. Process. Manage., 30, 875-886.
63. Gusfield,D. (1997) Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge.
64. Gusfield,D. (2002) Suffix Trees (and Relatives) come of age in Bioinformatics. In Proceedings of the IEEE Computer Society Conference on Bioinformatics. IEEE Computer Society, p. 3.
65. Gutell,R.R. et al. (1992) Identifying constraints on the higher-order structure of RNA: Continued development and application of comparative sequence analysis methods. Nucleic Acids Res., 20 5785-5795.
66. Haiminen,N. et al. (2007) Comparing segmentations by applying randomization techniques. BMC Bioinformatics, 7, 171.
67. Handl,J. et al. (2005) Computational cluster validation in post-genomic data analysis. Bioinformatics, 21, 3201-3212.
68. Hartemink,A. (2005) Reverse engineering gene regulatory networks. Nat. Biotechnol., 23, 554-556.
69. Hategan,A. and Tabus,I. (2004) Protein is compressible. In Proceedings of the 6th Nordic Signal Processing Symposium (NORSIG . IEEE Computer Society, pp. 192-195.
70. Healy,J. et al. (2003) Annotating large genomes with exact word matches. Genome Res., 13, 2306-2315.
71. Hyvonen,S. et al. (2007) Recurrent predictive models for sequence segmentation. In Advances in Intelligent Data Analysis VII (IDA 2007 Vol. 4723 of LNCS. Springer, Berlin, pp. 195-206.
72. Jonassen,I. (1997) Efficient discovery of conserved patterns using a pattern graph. Comput. Appl. Biosci., 13, 509-522.
73. Keogh,E. et al. (2004) Towards parameter-free data mining. In Proceedings of 10th ACM SIGKDD International Conference Knowledge Discovery and Data Mining. ACM, New York, pp. 206-215.
74. Kocsor,A. et al. (2005) Application of compression-based distance measures to protein sequence classification: A methodological study. Bioinformatics, 22, 407-412.
75. Koivisto,M. (2003)An MDL method for finding haplotype blocks and for estimating the strength of Haplotype block boundaries. In Proceedings of the Pacific Symposium on Biocomputing (PSB). World Scientific, pp. 502-513.
76. Konopka,A.K. (2005) Information theories in molecular biology and genomics. Nat. Encyclopedia Hum. Genome, 3, 464-469.
77. Korodi,G. and Tabus,I. (2005) An efficient normalized maximum likelihood algorithm for DNA sequence compression. ACM Trans. Inform. Syst., 23, 3-34.
78. Korodi,G. and Tabus,I. (2007) Compression of annotated nucleotide sequences. IEEE/ACM Trans. Comput. Biol. Bioinform., 4, 447-457.
79. Krasnogor,N. and Pelta,D.A. (2004) Measuring the similarity of protein structures by means of the Universal Similarity Metric. Bioinformatics, 20, 1015-1021.
80. Krishnamachari,A. et al. (2004) Study of DNA binding sites using the Rényi parametric entropy measure. J. Theor. Biol., 227 429-436.
81. Kruskal,J.B. and Sankoff,D. (eds) (1983) Time Wraps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA.
82. Lanctot,J.K. et al. (2000) Estimating DNAsequence entropy. In SODA 00: Proceedings of the Symposium on Discrete Algorithms. ACM-SIAM, pp. 409-418.
83. Lempel,A. and Ziv,J. (1976) On the complexity of finite sequences. IEEE Trans. Inform. Theory, 22, 75-81.
84. Li,M. and Vitányi,P.M.B. (1997) An Introduction to Kolmogorov Complexity and its Application. Springer, New York city.
85. Li,M. et al. (2001) An Information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics 17, 149-154.
86. Li,M. et al. (2003) The similarity metric. IEEE Trans. Inform. Theory, 50, 3250-3264.
87. Lifshits,Y. et al. (2008) Speeding upHMMdecoding and training by exploiting sequence repetitions. Algorithmica [doi 10.1007/s00453-007-9128-0].
88. Lió,P. et al. (1996) High statistics block entropy measures of DNA sequences. J. Theor. Biol., 180, 151-160.
89. Lippert,R.A. (2005) Space-efficient whole genome comparisons with Burrows-Wheeler Transforms. J. Comput. Biol., 12, 407-415.
90. Lippert,R.A. et al. (2005) A space-efficient construction of the Burrows-Wheeler transform for genomic data. J. Comput. Biol., 12, 943-951.
91. Liu,L. and Wang,T. (2008) Comparison of TOPS strings based on LZ complexity. J. Theor. Biol., 251, 159-166.
92. Liu,Q. et al. (2008) RNACompress: Grammar-based compression and informational complexity measurement of RNA secondary structure. BMC Bioinformatics, 9, 176+.
93. Loewenstern,D. and Yianilos,P.N. (1999) Significantly lower entropy estimates for natural DNA sequences. J. Comput. Biol., 6, 125-142.
94. Loewenstern,D. et al. (1995) DNA sequence classification using compression-based induction. Technical report, DIMACS.
95. Long,F. and Ding,C. (2005) Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans. Pattern Anal. Mach. Intell., 27, 1226-1238.
96. Ma,Q. and Wang,J.T.L. (2000) Evaluating the significance of sequence motifs by the minimum description length principle.
97. Madsen,B.E. et al. (2008) Short tandem repeats in human exons: A target for disease mutations. BMC Genomics, 9, 410+.
98. Manzini,G. and Rastero,M. (2005) A simple and fast DNA compressor. Softw. Pract. Exper., 35, 1397-1411.
99. Margolin,A.A. et al. (2004) Reverse engineering of the yeast transcriptional network using the ARACNE algorithm.
100. Margolin,A.A. et al. (2006a). ARACNE: An algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinformatics, 7(Suppl. 1), s7.
101. Margolin,A.A. et al. (2006b) Reverse engineering cellular networks. Nat. Protocols, 1, 663-672.
102. Matsumoto,T. et al. (2000) Biological sequence compression algorithms. Genome Inform., 11, 43-52.
103. Menconi,G. (2004) Sublinear growth of information in DNA sequences. Bull. Math. Biol., 67, 737-759.
104. Menconi,G. and Marangoni,R. (2006). A compression-based approach for coding sequences identifications in Prokaryotic Genomes. J. Comput. Biol., 13, 1477-1488.
105. Meyer,P.E. et al. (2007) Information-Theoretic inference of large transcriptional regulatory networks. EURASIP J. Bioinform. Syst. Biol., 2007, 8.
106. Milosavljevic,A. (1995) Discovering dependencies via algorithmic mutual information: A case study in DNA sequence comparisons. Mach. Learn. 21, 35-50.
107. Milosavljevic,A. and Jurka,J. (1993) Discovering simple DNA sequences by the algorithmic significance method. Comput. Appli. Biosci., 9 407-411.
108. Mozes,S. et al. (2007) Speeding upHMMdecoding and training by exploiting sequence repetitions. In Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (CPM). Springer, pp. 4-15.
109. Nature-Review (2008) Nature Reviews collection on microRNAs. Nat. Rev. [Epub ahead of print, doi:10.1038/nrg2202].
110. Navarro,G. and Mäkinen,V. (2007) Compressed full-text indexes. ACM Comput. Surv., 39, 2.
111. Nevill-Manning,C.G. and Witten,I.H. (1997) Compression and explanation using hierarchical grammars. Comput. J., 40, 103-116.
112. Nevill-Manning,C.G. et al. (1997) Enumerating and ranking discrete motifs. In Proceedigs of the 5th International Conference on Intelligent Systems for Molecular Biology. AAAI press, pp. 202-209.
113. Nevill-Manning,G.C. andWitten,I.H. (1999) Protein is incompressible. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 257-266.
114. Nykter,M. et al. (2005) Normalized compression distance for gene expression analysis. In Proceedings of GENSIPS IEEE International Workshop on Genomic Signal Processing and Statistics. IEEE, pp. 2-3.
115. Otu,H.H. and Sayood,K. (2003a)Adivide-and-conquer approach to fragment assembly. Bioinformatics, 19, 22-29.
116. Otu,H.H. and Sayood,K. (2003b) A new sequence distance measure for phylogenetic tree construction. Bioinformatics, 19, 2122-2130.
117. Parida,L. (2007) Pattern Discovery in Bioinformatics Theory & Algorithms. Chapman & Hall/CRC Taylor & Francis Group, New York.
118. Patil,N. et al. (2001) Blocks of limited haplotype diversity revealed by high-resolution scanning of human chromosome 21. Science 294, 1719-1723.
119. Pelta,D.A. et al. (2005) Protein structure comparison through fuzzy contact maps and the universal similarity metric. In Proceedings of the Joint 4th EUSFLAT 11th LFA Conference (EUSFLAT-LFA 05). Universitat Politécnica de Catalunya, pp. 1124-1129.
120. Powell,D.R. et al. (1998) Discovering simple DNA sequences by compression. In Proceedings of the Pacific Symposium on Biocomputing (PSB). World Scientific, pp. 597-608.
121. Quastler,H. (1953) Information Theory in Biology. University of Illinois Press, Urbana.
122. Reinert,G. et al. (2005) Statistics on words with applications to biological sequences. In Lotaire,M. (ed), Applied Combinatorics on Words. Vol. 105 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, pp. 252-323.
123. Rényi,A. (1961) On measures of entropy and information. In Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability, Vol. 1, University of California Press, Berkeley, CA, pp. 547-561.
124. Rissanen,J. and Yu,B. (2000) Coding and compression: A happy union of theory and practice. Am. Stat. Assoc., 95, 986-989.
125. Rissanen,J. et al. (2007) Editorial: Information theoretic methods in bioinformatics. EURASIP J. Bioinform. Syst. Biol., 7, 1-4.
126. Rivals,É. et al. (1996a) Compression and genetic sequences analysis. Biochimie, 78, 315-322.
127. Rivals,É. et al. (1996b). A guaranteed compression scheme for repetitive DNA sequences. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, p. 453.
128. Rivals,É. et al. (1997a) Detection of significant patterns by compression algorithms: The case of approximate tandem repeats in DNA sequences. Comput. Appl. Biosci., 13, 131-136.
129. Rivals,É. et al. (1997b) Fast discerning repeats in DNA sequences with a compression algorithm. In Proceedings of Genome Informatics Workshop. Universal Academy Press, Tokyo, pp. 215-226.
130. Rocha,J. et al. (2006) Compression ratios based on the Universal Similarity Metric still yield protein distances far from CATH distances. CoRR, abs/q-bio/0603007.
131. Ron,D. and Singer,Y. (1996) The power of amnesia: Learning probabilistic automata with variable memory length. In Machine Learning. Springer, Netherlands, pp. 117-149.
132. Sadakane,K. and Shibyya,T. (2001) Indexing huge genome sequences for solving various problems. Genome Inform., 12, 175-183.
133. Schmidt,A.O. and Herzel,H. (1997) Estimating the entropy of DNA sequences. J. Theor. Biol., 188, 369-377.
134. Schneider,T.D. et al. (1986) Information content of binding sites on nucleotide sequences. J. Mol. Biol., 188, 415-431.
135. Schulz,M.H. et al. (2008) Fast and adaptive variable order Markov chain construction. In WABI '08: Proceedings of the 8th International Workshop on Algorithms in Bioinformatics. Springer, pp. 306-317.
136. Sculley,D. and Brodley,C. (2006) Compression and machine learning: A new perspective on feature space vectors. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 332-332.
137. Sharan,R. and Ideker,T. (2006) Modeling cellular machinery through biological network comparison. Nat. Biotechnol., 24, 427-433.
138. Shkarin,D. (2002) PPM: One step to practicality. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 202-211.
139. Smith,T. and Waterman,M. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
140. Stern,L. et al. (2001) Discovering patterns in plasmodium falciparum genomic DNA. Mol. Biochem. Parasitol., 118, 175-186.
141. Storer,J.A. and Szymanski,T.G. (1982) Data compression via textual substitution. J. ACM, 29, 928-951.
142. Szpankowski,W. et al. (2003) An optimal DNA segmentation based on the MDL principle. In Proceedings of the IEEE Computer Society Conference on Bioinformatics. IEEE Computer Society, pp. 541-546.
143. Tabus,I. et al. (2003) DNA sequence compression using the normalized maximum likelihood model for discrete regression. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 253-262.
144. Ulitsky,I. et al. (2006) The average common substring approach to phylogenomic reconstruction. J. Comput. Biol., 13, 336-350.
145. Välimäki,N. et al. (2007) Compressed suffix tree - a basis for genome-scale sequence analysis. Bioinformatics, 23, 629-630.
146. Varré,J.-S. et al. (1999) Transformation distances: A family of dissimilarity measures based on movements of segments. Bioinformatics 15, 194-202.
147. Vinga,S. and Almeida,J.S. (2003) Alignment-free sequence comparison: A review. Bioinformatics, 19, 513-523.
148. Vinga,S. andAlmeida,J.S. (2004) Reńyi continuous entropy of DNA sequences. J. Theor. Biol., 231, 377-388.
149. Vinga,S. and Almeida,J.S. (2007) Local Reńyi entropic profiles of DNA sequences. BMC Bioinform., 8, 393.
150. Viterbi,A.J. (1967) Error bounds for convolution codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theory 13, 260-269.
151. Vo,B.D. and Vo,K.-P. (2004) Using column dependency to compress tables. In Proceedings of the IEEE Data Compression Conference (DCC). IEEE Computer Society, pp. 92-101.
152. Vo,B.D. and Vo,K.-P. (2007) Compressing table data with column dependency. Theor. Comput. Sci., 387, 273-283.
153. Wang,H. et al. (2002) An index structure for pattern similarity searching in DNA microarray data. In Proceedings of the IEEE Computer Society Conference on Bioinformatics (CSB '02), IEEE Computer Society, p. 256.
154. Wang,J.T.L. et al. (1994) Disovering active motifs in sets of related proteins and using them for classification. Nucl. Acids Res. 22, 2769-2775.
155. Wang,N. et al. (2002) Distribution of recombination crossovers and the origin of haplotype blocks: The interplay of population history, recombination, and mutation. Am. J. Hum. Genet., 29, 229-232.
156. Waterman,M.S. (1995) Introduction to Computational Biology. Maps, Sequences and Genomes. Chapman Hall, London.
157. Weiss,O. and Herzel,H. (1998) Correlations in protein sequences and property codes. J. Theor. Biol., 190, 341-353.
158. Weiss,O. et al. (2000) Information content of protein sequences. J. Theor. Biol., 206, 379-386.
159. Witten,I.H. et al. (1999) Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann Publishers, Los Altos, CA.
160. Zhang,K. et al. (2002) A dynamic programming algorithm for haplotype block partitioning. In Proc. Natl Acad. Sci. USA, 7335-7339.
161. Zhang,S. et al. (2008) Biomolecular network querying: A promising approach in systems biology. BMC Syst. Biol., 2, 5.
162. Zhou,W. et al. (2007) Feature selection for microarray data analysis using mutual information and rough set theory. In IFIP International Federation for Information Processing, Vol. 204, Springer, Boston, pp. 916-927.
163. Zhou,X. et al. (2004) Gene clustering based on clusterwide mutual information. J. Comput. Biol., 11, 147-161.
164. Ziv,J. (1988) On classification with empirically observed statistics and universal data compression. IEEE Trans. Inform. Theory, 34, 278-286.
165. Ziv,J. (2008) On finite memory universal data compression and classification of individual sequences. IEEE Trans. Inform. Theory 54, 1626-1636.
166. Ziv,J. and Lempel,A. (1977) A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, 23, 337-343.
167. Ziv,J. and Lempel,A. (1978) Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory, 24, 530-536.