Distance measures for biological sequences: Some recent approaches

International Journal of Approximate Reasoning

Volumn 47, Issue 1, 2008, Pages 109-124

  Mantaci, Sabrina ^a   Restivo, Antonio ^a   Sciortino, Marinella ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SEQUENCES; GENOME SEQUENCING; MODERN MOLECULAR BIOLOGY; SEQUENCE ALIGNMENT;

BIOACTIVITY; GENES; MEASUREMENT THEORY; MOLECULAR BIOLOGY;

DISTANCE MEASUREMENT;

EID: 36248953301     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2007.03.011     Document Type: Article

References (42)

1. S.F. Altschul, W. Gish, W. Miller, E.W. Myers, D.J. Lipman, Basic local alignment search tool, J. Mol. Biol. 215 (1990) 403-410.
2. D. Benedetto, E. Caglioti, V. Loreto, Language trees and zipping, Phys. Rev. Lett. 88 (4) (2002).
3. C.H. Bennett, P. Gács, M. Li, P. Vitányi, W. Zurek, Information distance, IEEE Trans. Inform. Theor. 44 (4) (1998) 1407-1423.
4. C.H. Bennett, M. Li, B. Ma, Chain letters and evolutionary histories, Sci. Am. (June) (2003) 76-81.
5. B.E. Blaisdell, A measure of similarity of sets of sequences not requiring sequence alignment, Proc. Natl. Acad. Sci. USA 83 (1986) 5155-5159.
6. B.E. Blaisdell, Effectiveness of measures requiring and not requiring prior sequence alignment for estimating the dissimilarities of natural sequences, J. Mol. Evol. (29) (1989) 526-537.
7. M. Burrows, D.J. Wheeler, A block sorting data compression algorithm, Technical report, DIGITAL System Research Center, 1994.
8. X. Chen, B. Francia, M. Li, Shared information and program plagiarism detection, IEEE Trans. Inform. Theor. 50 (7) (2004) 1545-1551.
9. R. Cilibrasi, The complearn toolkit, 2003. http://complearn.sourceforge. net.
10. R. Cilibrasi, P. Vitányi, Clustering by compression, IEEE Trans. Inform. Theor. 51 (4) (2005) 1523-1545.
11. R. Cilibrasi, P. Vitányi, R. de Wolf, Algorithmic clustering of music based on string compression, Comput. Music J. 28 (4) (2004) 49-67.
12. G. Cormode, S. Muthukrishnan, The string edit distance matching problem with moves, in: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 2001.
13. G. Cormode, M. Patterson, S.C. Sahinalp, U. Vishkin, Communication complexity of document exchange, in: Proceedings of ACMSIAM Symposium on Discrete Algorithms, 2000.
14. M. Crochemore, W. Rytter, Jewels of Stringology, World Scientific, 2002.
15. F. Ergun, S. Muthukrishnan, C. Sahinalp, Comparing sequences with segment rearrangements, in: Proceedings of the FSTTCS'03, Bombay, India, Lecture Notes in Computer Science, 2003, pp. 183-194.
16. N.J. Fine, H.S. Wilf, Uniqueness theorem for periodic functions, Proc. Am. Math. Soc. (16) (1965) 109-114.
17. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.
18. A. Lempel, J. Ziv, On the complexity of finite sequences, IEEE Trans. Inform. Theor. IT-22 (1) (1976) 75-81.
19. A. Lempel, J. Ziv, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theor. 23 (3) (1977) 337-343.
20. A. Lempel, J. Ziv, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theor. 24 (5) (1978) 530-536.
21. V.I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Cybern. Control Theory 10 (8) (1966) 707-710
22. Original in Doklady Akademii Nauk SSSR 163(4) (1965) 845-848.
23. M. Li, J.H. Badger, X. Chen, S. Kwong, P. Kearney, H. Zhang, An information based sequence distance and its application to whole mitochondrial genome phylogeny, Bioinformatics 17 (2001) 149-154.
24. M. Li, X. Chen, X. Li, B. Ma, P. Vitányi, The similarity metric, IEEE Trans. Inform. Theor. 12 (5) (2004) 3250-3264.
25. M. Li, P. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, second ed., Springer, New York, 1997.
26. D. Lopresti, A. Tomkins, Block edit models for approximate string matching, Theor. Comput. Sci. 181 (1) (1997) 159-179.
27. S. Mantaci, A. Restivo, G. Rosone, M. Sciortino, A new combinatorial approach to sequence comparison (journal version), Theory of Computing Systems (TOCS), in press.
28. S. Mantaci, A. Restivo, G. Rosone, M. Sciortino, An extension of the Burrows Wheeler Transform and applications to sequence comparison and data compression, in: Alberto Apostolico, Maxime Crochemore, Kunsoo Park (Eds.), Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, 19-22 June 2005, Proceedings, Lecture Notes in Computer Science, vol. 3537, Springer, 2005, pp. 178-189.
29. S. Mantaci, A. Restivo, G. Rosone, M. Sciortino, A new combinatorial approach to sequence comparison, in: Mario Coppo, Elena Lodi, G. Michele Pinna (Eds.), Proceedings of ICTCS 2005, Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, 12-14 October 2005, Lecture Notes in Computer Science, vol. 3701, Springer, 2005, pp. 348-359.
30. S. Mantaci, A. Restivo, G. Rosone, M. Sciortino, An extension of the Burrows Wheeler Transform, Theor. Comput. Sci., in press.
31. S. Muthukrishnan, S.C. Sahinalp, Approximate nearest neighbors and sequence comparison with block operations, in: Proceedings of ACM-STOC, 2000.
32. S. Muthukrishnan, S.C. Sahinalp, Improved algorithm for sequence comparison with block reversal, in: Proceedings of LATIN, 2002.
33. S.B. Needleman, C.D. Wunsch, A general method applicable to the search for similarities in the amino-acid sequences of two proteins, J. Mol. Biol. 148 (1970) 443-453.
34. H.H. Otu, K. Sayood, A new sequence distance measure for phylogenetic tree construction, Bioinformatics 19 (16) (2003) 2122-2130.
35. W.R. Pearson, D.J. Lipman, Improved tools for biological sequence comparison, Proc. Natl. Acad. Sci. USA 85 (8) (1988) 2444-2488.
36. P.A. Pevzner, Statistical distance between texts and filtration methods in sequence comparison, Comput. Appl. Biosci. (8) (1992) 121-127.
37. M. Rodeh, V.R. Pratt, Shimon Even, Linear algorithm for data compression via string matching, JACM 28 (1) (1981) 16-24.
38. D. Sankoff, J.B. Kruskal, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley Publishing Company, Reading, MA, 1983.
39. J.S. Varre, J.P. Delahaye, E. Rivals, The tranformation distance: a dissimilarity measure based on movements of segments, Bioinformatics 15 (3) (1999) 194-202.
40. S. Vinga, J. Almeida, Alignment-free sequence comparison -a review, Bioinformatics 19 (4) (2003) 513-523.
41. R.A. Wagner, M.J. Fischer, The string-to-string correction problem, J. ACM 21 (1974) 168-173.
42. J. Ziv, N. Merhav, A measure of relative entropy between individual sequences with application to universal classification, IEEE Trans. Inform. Theor. 39 (4) (1993) 1270-1279.