A new combinatorial approach to sequence comparison

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3701 LNCS, Issue , 2005, Pages 348-359

  Mantaci, S ^a   Restivo, A ^a   Rosone, G ^a   Sciortino, M ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC CATEGORIZATION OF SEQUENCES; BURROWS-WHEELER TRANSFORM; MITOCHONDRIAL GENOME PHYLOGENY PROBLEM;

DATA COMPRESSION; GENES; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SET THEORY;

INFORMATION THEORY;

EID: 33646193309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_28     Document Type: Conference Paper

References (25)

1. D. Benedetto, E. Caglioti, and V. Loreto. Zipping out relevant information. Computing in Science and Engineering, pages 80-85, 2003.
2. M. Burrows and D.J. Wheeler. A block sorting data compression algorithm. Technical report, DIGITAL System Research Center, 1994.
3. 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.
4. R. Cilibrasi and P. Vitányi. Clustering by compression. IEEE Trans. Information Theory, 51(4):1523-1545, April 2005.
5. M. Crochemore, J. Désarménien, and D. Perrin. A note on the Burrows-Wheeler transformation. Theoret. Comput. Sci., 332:567-572, 2005.
6. F. Ergun, S. Muthukrishnan, and C. Sahinalp. Comparing sequences with segment rearrangements. Lecture Notes in Comput. Sci, pages 183-194, 2003. Proc. of the FSTTCS'03, Bombay, India.
7. P. Fenwick. The Burrows-Wheeler transform for block sorting text compression: principles and improvements. The Computer Journal, 39(9):731-740, 1996.
8. I. M. Gessel and C. Reutenauer. Counting permutations with given cycle structure and descent set. J. Combin. Theory Ser. A, 64(2):189-215, 1993.
9. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
10. L. Hie and S. Constantinescu. Fine and Wilf's theorem for any number of periods. TUCS (Turku Center for Computer Science) General Publication, 25:65-74, 2003. proc. WORDS 2003.
11. N. J. Larsson and K. Sadakane. Faster suffix sorting. Technical Report LU-CS-TR:99-214, LUNDFD6/(NFCS-3140)/l-43/(1999), Department of Computer Science, Lund University, Sweden, 1999.
12. M. Li, J.H. Badger, X. Chen, S. Kwong, P. Kearney, and H. Zhang. An information based sequence distance and its application to whole mitochondrial genome phytogeny. Bioinformatics, 17:149-154, 2001.
13. M. Li, X. Chen, X. Li, B. Ma, and P. Vitányi. The similarity metric. IEEE Trans. Inform. Th., 12(5):3250-3264, 2004.
14. M. Lothaire. Algebraic Combinatorics on Words. Cambridge University Press, 2002.
15. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
16. S. Mantaci, A. Restivo, G. Rosone, and M. Sciortino. An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. In Alberto Apostolico, Maxime Crochemore, and Kunsoo Park, editors, Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, volume 3537 of Lecture Notes in Computer Science, pages 178-189. Springer, 2005.
17. S. Mantaci, A. Restivo, and M. Sciortino. Burrows-Wheeler transform and Sturmian words. Informat. Proc. Lett., 86:241-246, 2003.
18. S. Mantaci, A. Restivo, and M. Sciortino. An extension of the Burrows-Wheeler Transform to k words. Technical Report 267, University of Palermo, Dipartimento di Matematica ed Appl., December 2004.
19. S. Mantaci, A. Restivo, and M. Sciortino. An Extension of the Burrows Wheeler Transform to k Words (Extended Abstract). In 2005 Data Compression Conference (DCC 2005), 29-31 March 2005, Snowbird, UT, USA, page 469. IEEE Computer Society, 2005.
20. G. Manzini. The Burrows-Wheeler transform: Theory and practice. In Proc. of the 24th International Symposium on Mathematical Foundations of Computer Science (MFCS '99), pages 34-47. Springer-Verlag LNCS n. 1672, 1999.
21. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, 1976.
22. F. Mignosi and A. Restivo. Periodicity. In M. Lothaire, Algebraic Combinatorics on Words, chapter 8, pages 237-274. Cambridge University Press, 2002.
23. H.H. Otu and K. Sayood. A new sequence distance measure for phylogenetic tree construction. Bioinformatics, 19(16):2122-2130, 2003.
24. R. Tijdeman and L.Zamboni. Fine and Wilf words for any periods. Indag. Math., 14(1):135-147, 2003.
25. S. Vinga and J. Almeida. Alignment-free sequence comparison - a review. Bioinformatics, 19(4):513-523, 2003.