Finding approximate repetitions under hamming distance

Theoretical Computer Science

Volumn 303, Issue 1, 2003, Pages 135-156

  Kolpakov, Roman ^b   Kucherov, Gregory ^a  

^a LORIA   (France)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PATTERN MATCHING;

HAMMING DISTANCE;

COMPUTER SCIENCE;

EID: 0038040542     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00448-6     Document Type: Conference Paper

References (27)

1. Benson G. An algorithm for finding tandem repeats of unspecified pattern size. Istrail S., Pevzner P., Waterman M. Proc. 2nd Annu. Internat. Conf. on Computational Molecular Biology (RECOMB 98). 1998;20-29 ACM Press, New York.
2. Benson G. Tandem repeats finder. a program to analyze DNA sequences Nucleic Acids Res. 27(2):1999;573-580.
3. Benson G., Waterman M. A method for fast database search for all. k -nucleotide repeats Nucleic Acids Res. 22:1994;4828-4836.
4. Choffrut C., Karhumäki J. Combinatorics of words. Rozenberg G., Salomaa A. Handbook on Formal Languages, Vol. I. 1997;329-438 Springer, Berlin, Heidelberg, New York.
5. R. Cole, R. Hariharan, Approximate string matching: a simpler faster algorithm, in: Proc. 9th Annu. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, CA, 1998, pp. 463-472.
6. Crochemore M. An optimal algorithm for computing the repetitions in a word. Inform. Process. Lett. 12:1981;244-250.
7. Crochemore M. Recherche linéaire d'un carré dans un mot. C. R. Acad. Sci. Paris Sér. I Math. 296:1983;781-784.
8. Crochemore M., Rytter W. Squares, cubes, and time-space efficient string searching. Algorithmica. 13:1995;405-425.
9. Galil Z., Seiferas J. Time-space optimal string matching. J. Comput. System Sci. 26(3):1983;280-294.
10. Gusfield D. Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. 1997;Cambridge University Press, Cambridge.
11. Iliopoulos C., Moore D., Smyth W. A characterization of the squares in a Fibonacci string. Theoret. Comput. Sci. 172:1997;281-291.
12. Kolpakov R., Kucherov G. Finding maximal repetitions in a word in linear time. Proc. 1999 Symp. on Foundations of Computer Science, New York (USA). 1999;596-604 IEEE Computer Society, Silver Spring, MD.
13. R. Kolpakov, G. Kucherov, On maximal repetitions in words, in: Proc. 12th Internat. Symp. on Fundamentals of Computation Theory, 1999, Iasi (Romania), Lecture Notes in Computer Science, Springer, Berlin, 1999, pp. 374-385.
14. Kosaraju S.R. Computation of squares in string. Crochemore M., Gusfield D. Proc. 5th Annu. Symp. on Combinatorial Pattern Matching. Lecture Notes in Computer Science. Vol. 807:1994;146-150 Springer, Berlin.
15. Landau G., Schmidt J. An algorithm for approximate tandem repeats. Apostolico A., Crochemore M., Galil Z., Manber U. Proc. 4th Annu. Symp. on Combinatorial Pattern Matching. Lecture Notes in Computer Science. Vol. 684:1993;120-133 Springer, Berlin, Padova, Italy.
16. Landau G., Schmidt J., Sokol D. An algorithm for approximate tandem repeats. J. Comput. Biol. 8(1):2001;1-18.
17. Le Fleche P., Hauck Y., Onteniente L., Prieur F., Denoeud A., Ramisse V., Sylvestre P., Benson G., Ramisse F., Vergnaud G. A tandem repeats database for bacterial genomes. application to the genotyping of Yersinia pestis and Bacillus anthracis BMC Microbiol. 1(1):2001;2.
18. M. Lothaire, Combinatorics on Words, in: Encyclopedia of Mathematics and its Applications, Vol. 17, Addison-Wesley, Reading, MA, 1983.
19. Main M., Lorentz R. An. O(n log n) algorithm for finding all repetitions in a string J. Algorithms. 5(3):1984;422-432.
20. Main M.G. Detecting leftmost maximal periodicities. Discrete Appl. Math. 25:1989;145-153.
21. Rivals E., Delgrange O., Delahaye J.-P., Dauchet M. A first step towards chromosome analysis by compression algorithms. Bourbakis N. Proc. 1st IEEE Symp. on Intelligence in Neural and Biological Systems (INBS). 1995;IEEE Computer Society, Herndon, VA.
22. Rodeh M., Pratt V., Even S. Linear algorithm for data compression via string matching. J. ACM. 28(1):1981;16-24.
23. Sagot M.-F., Myers E. Identifying satellites in nucleic acid sequences. Istrail S., Pevzner P., Waterman M. Proc. 2nd Annu. Internat. Conf. on Computational Molecular Biology (RECOMB 98). 1998;234-242 ACM Press, New York.
24. Slisenko A. Detection of periodicities and string matching in real time. J. Soviet Math. 22:1983;1316-1386.
25. J. Stoye, D. Gusfield, Linear time algorithms for finding and representing all the tandem repeats in a string, Technical Report CSE-98-4, Computer Science Department, University of California, Davis, 1998.
26. Tarjan R.E. Amortized computational complexity. SIAM J. Algebraic Discrete Methods. 6(2):1985;306-318.
27. van Belkum A., Scherer S., van Leeuwen W., Willemse D., van Alphen L., Verbrugh H. Variable number of tandem repeats in clinical strains of Haemophilus influenzae. Infect. Immun. 65(12):1997;5017-5027.