Novel Combinatorial and Information-Theoretic Alignment-Free Distances for Biological Data Mining

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

Volumn , Issue , 2010, Pages 321-359

  Epifanio, Chiara ^a   Gabriele, Alessandra ^a   Giancarlo, Raffaele ^a   Sciortino, Marinella ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

Alignment free methods, and notion of subword composition of sequences extensive experimentation, significant for biological data mining; Novel combinatorial and information theoretic alignment free distances for biological data mining, combinatorial alignment free methods; Sequence comparison, central role in scientific areas for computational molecular biology

Indexed keywords

EID: 84885963428     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470892107.ch16     Document Type: Chapter

References (86)

1. Alignment-Free Vinga and Almeida Library. http://bioinformatics.musc.edu/resources.html.
2. CATH DataBase. http://www.cathdb.info/.
3. Galaxy/Laboratory for Bioinformatics-Padova. http://bcb.dei.unipd.it/.
4. GPCRIPDB: Information system for GPCR interacting proteins. http://www.gpcr.org.
5. GPCRIPDB: Information system for GPCR interacting proteins. http://www.gpcr.org/ GPCRIP/multali/multali.html.
6. Kolmogorov Library Supplementary Material Web Page. http://www.math.unipa.it/ raffaele/ kolmogorov/datasets/.
7. NCBI Taxonomy. http://www.ncbi.nlm.nih.gov/Taxonomy/.
8. Phylogenetic classification of proteins encoded in complete genomes. http://www.ncbi. nlm.nih.gov/COG/.
9. The carbohydrate-active enzymes (CAZy) database. http://www.cazy.org/.
10. The D2Z Web Site. http://veda.cs.uiuc.edu/cgi-bin/d2z/download.pl.
11. The ProCKSI-Server. http://www.procksi.net/.
12. H. Metin Aktulga, I. Kontoyiannis, L.A. Lyznik, L. Szpankowski, A.Y. Grama, andW. Szpankowski. Identifying statistical dependence in genomic sequences via mutual information estimates. EURASIP J Bioinformatics Syst Biol, 2007.
13. S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman. Basic local alignment search tool. J Mol Biol, 215:403-410, 1990.
14. S.F. Altschul, T.L. Madden, A.A. Schaffer, J. Zhang, Z. Zhang, W. Miller, and D.J. Lipman. Gapped blast and psiblast: A new generation of protein database search programs. Nucleic Acids Res, 25:3389-3402, 1997.
15. A. Apostolico, M. Comin, and L. Parida. Mining, compressing and classifying with extensible motifs. Algorithm Mol Biol, 1:4, 2006.
16. A. Apostolico and O. Denas. Fast algorithms for computing sequence distances by exhaustive substring composition. Algorithms Mol Biol, 3(1):13, 2008.
17. D. Barthel, J.D. Hirst, J. Blazewicz, E.K. Burke, and N. Kransnogor. ProCKSI: A decision support system for protein (structure) comparison, knowledge, similarity and information. BMC Bioinformatics, 8:416, 2007.
18. B.E. Blaisdell. A measure of the similarity of sets of sequences not requiring sequence alignment. Proc Natl Acad Sci, 83:5155-5159, 1986.
19. M. Burrows and D.J. Wheeler. A block sorting data compression algorithm. Technical report, DIGITAL System Research Center, 1994.
20. Y. Cao, A. Janke, P.J. Waddell, M. Westerman, O. Takenaka, S. Murata, N. Okada, S. Pääbo, and M. Hasegawa. Conflict among individual mitochondrial proteins in resolving the phylogeny of eutherian orders. J Mol Evol, 47:307-322, 1998.
21. L.P. Chew and K. Kedem. Finding the consensus shape for a protein family. Algorithmica, 38:115-129, 2003.
22. R. Cilibrasi and P.M.B. Vitányi. Clustering by compression. IEEE Trans Inform Theory, 51(4):1523-1545, 2005.
23. J.R. Cole, B. Chai, T.L. Marsh, R.J. Farris, Q. Wang, S.A. Kulam, S. Chandra, D.M. McGarrell, T.M. Schmidt, G.M. Garrity, and J.M. Tiedje. The ribosomal database project (rdp-ii: Previewing a new autoaligner that allows regular updates and the new prokaryotic taxonomy. Nucleic Acids Res, 31:442-443, 2003.
24. E. Corel, R. El Fegalhi, F. Gérardin, M. Hoebeke, M. Nadal, A. Grossmann, and C. Devauchelle. Local similarities and clustering of biologicalsequences: New insights from n-localdecoding. The First International Symposium on Optimization and Systems Biology (OSB07), Beijing, China, 2007, pp. 189-195.
25. T.M. Cover and J.A. Thomas. Elements of Information Theory. Wiley, New York, 1991.
26. Q. Dai, Y. Yang, and T.Wang. Markov model plus-word distributions: A synergy that produces novel statistical measures for sequence comparison. Bioinformatics, 24(20):2296- 2302, 2008.
27. M.O. Dayhoff, R. Schwartz, and B. Orcutt. A model of evolutionary change in proteins. In M.O. Dayhoff, editor, Atlas of Protein Sequence and Structure, volume 5 of National Biomedical Research Foundation, Washington, DC, 1978, pp. 345-352.
28. G. Didier, L. Debomy,M. Pupin, M. Zhang, A. Grossmann, C. Devauchelle, and I. Laprevotte. Comparing sequences without using alignments: Application to hiv/siv subtyping. BMC Bioinformatics, 2(8:1), 2007.
29. G. Didier, I. Laprevotte, M. Pupin, and A. Hénaut. Local decoding of sequences and alignment-free comparison. J Comput Biol, 13(8):1465-1476, 2006.
30. P. Ferragina, R. Giancarlo, V. Greco, G. Manzini, and G. Valiente. Compression-based classification of biological sequences and structures via the universal similarity metric: experimental assessment. BMC Bioinformatics, 8, 2007.
31. P. Ferragina, R. González, G. Navarro, and R. Venturini. Compressed text indexes: From theory to practice! ACM J Exp Algorithmics, 2008.
32. G. Fichant and C. Gautier. Statistical method for predicting protein coding regions in nucleic acid sequences. Comput Appl Biosci, 3:287-295, 1987.
33. N.J. Fine and H.S. Wilf. Uniqueness theorem for periodic functions. Proc Am Math Soc, 16:109-114, 1965.
34. T.P. Flores, D.M. Moss, and J.M. Thornton. An algorithm for automatically generating protein topology cartoons. Protein Eng Des Sel, 7:31-37, 1994.
35. S. Foret, M. Kantorovitz, and C. Burden. Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences. BMC Bioinformatics, 7(Suppl 5):S21, 2006.
36. S.M. Gallo, L. Li, Z. Hu, and M.S. Halfon. EDfly: a regulatory element database for rosophila. Bioinformatics, 22(3):381-383, 2006.
37. H. Gao, W.J. Gordon-Kamm, and L.A. Lyznik. Asf/sf2-like maize pre-mrna splicing factors affect splice site utilization and their transcripts are alternatively spliced. Gene, 339(1-2):25-37, 2004.
38. R. Giancarlo, D. Scaturro, and F. Utro. Textual data compression in computational biology: a synopsis. Bioinformatics, 25(13):1575-1586, 2009.
39. D.R. Gilbert, D.R. Westhead, N. Nagano, and J.M. Thornton. Motif-based searching in tops protein topology databases. Bioinformatics, 15:317-326, 1999.
40. O. Gotoh. An improved algorithm for matching biological sequences. J Mol Biol, 162:705-708, 1982.
41. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge, U.K., 1997.
42. S. Henikoff and J.G. Henikoff. Amino acid substitution matrices from protein blocks. Proc Natl Acad Sci USA, 89:10915-10919, 1992.
43. A.C.-C. Yang S.-S. Hseu, H.-W. Yien, A. L. Goldberger, and C.-K. Peng. Linguistic analysis of the human heartbeat using frequency and rank order statistics. Phys Rev Lett, 90(10):108103, 2003.
44. W. Kabsch and C. Sander. Dictionary of protein secondary structure: Pattern recognition of hydrogen-bonded and geometrical features. Biopolymers, 22(12):2577-2637, 1983.
45. M.R. Kantorovitz, H.S. Booth, C.J. Burden, and S.R. Wilson. Asymptotic behavior of k-word matches between two random sequences. J Appl Probab, 44:788-805, 2007.
46. M.R. Kantorovitz, C.J. Burden, and S.R. Wilson. Approximate word matches between two random sequences. Ann Appl Probab, 18:1-21, 2008.
47. M.R. Kantorovitz, G.E. Robinson, and S. Sinha. A statistical method for alignment-free comparison of regulatory sequences. ISMB/ECCB (Supplement of Bioinformatics), 2007, pp. 249-255.
48. A. Kelil, S. Wang, R. Brzezinski, and A. Fleury. Cluss: Clustering of protein sequences based on a new similarity measure. BMC Bioinformatics, 8:286, 2007.
49. M. Kimura. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J Mol Evol, 16:111-120, 1980.
50. J. Kleffe and M. Borodovsky. First and second moment of counts of words in random texts generated by markov chains. Comput Appl Biosci, 8(5):433-441, 1992.
51. N. Krasnogor and D.A. Pelta. Measuring the similarity of protein structures by means of the universal similarity metric. Bioinformatics, 20(7).
52. M. Li, J. Badger, X. Chen, S. Kwong, P. Kearney, and H. Zhang. An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics, 17(2):149-154, 2001.
53. M. Li, X. Chen, X. Li, B. Ma, and P. Vitányi. The similarity metric. IEEE Trans Inform Theory, 50(12):3250-3264, 2004.
54. W. Li, W. Fang, L. Ling, J. Wang, Z. Xuan, and R. Chen. Phylogeny based on whole genome as inferred from complete information set analysis. J Biol Phys, 28(3):439-447, 2002.
55. R.A. Lippert, H. Huang, and M.S.Waterman. Distributional regimes for the number of kword matches between two random sequences. Proc Natl Acad Sci USA, 99(22):13980- 13989, 2002.
56. G. Lu, S. Zhang, and X. Fang. An improved string composition method for sequence comparison. BMC Bioinformatics, 9(Suppl 6):S15, 2008.
57. S. Mantaci, A. Restivo, G. Rosone, and M. Sciortino. A new combinatorial approach to sequence comparison. Theor Comput Syst, 42(3):411-429, 2008.
58. F. Mignosi, A. Restivo, and M. Sciortino. Words and forbidden factors. Theor Comput Sci, 273(1-2):99-117, 2002.
59. G. Navarro and V. Mäkinen. Compressed full-text indexes. ACM Comput Surv, 39:2, 2007.
60. S.B. Needleman and C.D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol, 48:443-453, 1970.
61. H.H. Otu and K. Sayood. A new sequence distance measure for phylogenetic tree construction. Bioinformatics, 19(16):2122-2130, 2003.
62. F. Pearl, A. Todd, I. Sillitoe, M. Dibley, O. Redfern, T. Lewis, C. Bennett, R. Marsden, A. Grant, D. Lee, et al. The cath domain structure database and related resources gene3d and dhs provide comprehensive domain family information for genome analysis. Nucleic Acids Res, 33(D):D247-D251, 2005.
63. W.R. Pearson and D.J. Lipman. Improved tools for biological sequence comparison. Proc Natl Acad Sci, 85(8):2444-2448, 1998.
64. W.R. Pearson. Rapid and sensitive sequence comparison with fastp and fasta. Meth Enzymol, 183:63-98, 1990.
65. W.R. Pearson and D.J. Lipman. Improved tools for biological sequence comparison. Proc Natl Acad Sci USA, 85:2444-2448, 1988.
66. P. Petrilli. Classification of protein sequences by their dipeptide composition. Comput Appl Biosci, 9(2):205-209, 1993.
67. T.D. Pham and J. Zuegg. A probabilistic measure for alignment-free sequence comparison. Bioinformatics, 20:3455-3461, 2004.
68. J. Qi, H. Luo, and B. Hao. Cvtree: A phylogenetic tree reconstruction tool based on whole genomes. Nucleic Acids Res, 32:45-47, 2004.
69. J. Qi, B. Wang, and B.-I. Hao. Whole proteome prokaryote phylogeny without sequence alignment: A k-string composition approach. J Mol Evol, 58:111, 2004.
70. D. Sankoff and J.B. Kruskal. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA, 1983.
71. M. Sierk and W. Person. Sensitivity and selectivity in protein structure comparison. Protein Sci, 13(3):773-785, 2004.
72. T.F. Smith and M.S.Waterman. Identification of common molecular subsequences. J Mol Biol, 147:195-197, 1981.
73. G.W. Stuart, K. Moffett, and S. Baker. Integrated gene and species phylogenies from unaligned whole genome protein sequences. Bioinformatics, 18:100-108, 2002.
74. G.W. Stuart, K. Moffett, and J.J. Leader. A comprehensive vertebrate phylogeny using vector representations of protein sequences from whole genomes.Mol Biol Evol, 19:554- 562, 2002.
75. B. Thiruv, G. Quon, S.A. Saldanha, and B. Steipe. Nh3d: A reference dataset of nonhomologous protein structures. BMC Struct Biol, 5:12, 2005.
76. I. Ulitsky, D. Burstein, T. Tuller, and B. Chor. The average common substring approach to phylogenomic reconstruction. J Comput Biol, 13(2):336-350, 2006.
77. J. van Helden. Metrics for comparing regulatory sequences on the basis of pattern counts. Bioinformatics, 20(3):399-406, 2004.
78. S. Vinga and J.S. Almeida. Alignment-free sequence comparison-a review. Bioinformatics, 19(4):513-523, 2003.
79. S. Vinga, R. Gouveia-Oliveira, and J.S. Almeida. Comparative evaluation of word composition distances for the recognition of scop relationships. Bioinformatics, 20(2):206-215, 2004.
80. J. Wang and X. Zheng. WSE, a new sequence distance measure based on word frequencies. Math Biosci, 215:78-83, 2008.
81. M.S.Waterman. Introduction to Computational Biology. Maps, Sequences and Genomes. Chapman Hall, London, 1995.
82. D.R. Westhead, D.C. Hutton, and J.M. Thornton. An atlas of protein topology cartoons available on the world wide web. Trends Biochem Sci, 23:35-36, 1998.
83. D.R. Westhead, T. Slidel, T. Flores, and J.M. Thornton. Protein structural topology: Automated analysis and diagrammatic representations. Protein Sci, 8(4):897-904, 1999.
84. J.M.Word, S.C. Lovell, T.H. LaBean, H.C. Taylor, M.E. Zalis, B.K. Presley, J.S. Richardson, and D.C. Richardson. Visualizing and quantifying molecular goodness-of-fit: Smallprobe contact dots with explicit hydrogen atoms. J Mol Biol, 285(4):1711-1733, 1999.
85. T.-J. Wu, Y.-C. Hsieh, and L.-A. Li. Statistical measures of dna sequence dissimilarity under markov chain models of base composition. Biometrics, 57(2):441-448, 2001.
86. X. Wu, X.-F. Wan, G. Wu, D. Xu, and G. Lin. Phylogenetic analysis using complete signature information of whole genomes and clustered neighbour-joining method. IJBRA, 2(3):219-248, 2006.