Speeding up the detection of evolutive tandem repeats

Theoretical Computer Science

Volumn 310, Issue 1-3, 2004, Pages 309-328

  Groult, Richard ^a   Léonard, Martine ^a   Mouchard, Laurent ^a,b  

^a UNIVERSITÉ DE ROUEN   (France)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

DNA sequences; Evolutive tandem repeats; Hamming distance

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DNA;

EVOLUTIVE TANDEM REPEATS;

COMPUTER SCIENCE;

EID: 0242440255     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00423-7     Document Type: Article

References (20)

1. Ahrendt S.A., Decker P.A., Doffek K., Wang B., Xu L., Demeure M.J., Jen J., Sidransky D. Microsatellite instability at selected tetranucleotide repeats is associated with p53 mutations in non-small cell lung cancer. Cancer Res. 60(9):2001;2488-2491.
2. Apostolico A., Preparata F.P. Optimal off-line detection of repetitions in a string. Theoret. Comput. Sci. 22(3):1983;297-315.
3. Benson G. An algorithm for finding tandem repeats of unspecified pattern size. Istrail S., Pevzner P., Waterman M. Proc. Second Annu. Internat. Conf. Computational Molecular Biology (RECOMB-98). March 22-25 1998;20-29 ACM Press, New York.
4. Benson G. Tandem repeats finder. a program to analyze DNA sequences Nucleic Acids Res. 27(2):1999;573-580.
5. Crochemore M. An optimal algorithm for computing the repetitions in a word. Inform. Process. Lett. 12(5):1981;244-250.
6. R. Groult, M. Léonard, L. Mouchard, Evolutive tandem repeats using Hamming distance, in: K. Diks, W. Rytter (Eds.), Proc. MFCS'02: the 27th Internat. Symp. Mathematical Foundations of Computer Science, Warszawa, Otwock, Poland, August 2002, Lecture Notes in Computer Science, Vol. 2420, Springer, Berlin, pp. 292-304.
7. D. Gusfield, J. Stoye, Linear time algorithms for finding and representing all the tandem repeats in a string, Technical Report CSE-98-E, 1998.
8. Heinimann K., Muller H., Dobbie Z. Microsatellite instability in colorectal cancer. New England J. Med. 342(21):2000;1607-1608.
9. Iliopoulos C.S., Kumar M., Mouchard L., Venkatesh S. Motif evolution in polyphonic musical sequences. Brankovic L., Ryan J. Proc. the 11th Australasian Workshop on Combinatorial Algorithms. 2000;53-66 Hunter Valley, Australia.
10. Iliopoulos C.S., Moore D.W.G., Park K. Covering a string. Algorithmica. 16:1996;289-297.
11. C.S. Iliopoulos, L. Mouchard, An O(n log n) algorithm for computing all maximal quasiperiodicities in strings, in: C.S. Calude, M.J. Dinneen (Eds.), Combinatorics, Computation and Logic, Proc. DMTCS'99 and CATS'99, Auckland, New-Zealand, Lecture Notes in Computer Science, Springer, Singapore, 1999, pp. 262-272.
12. R.M. Kolpakov, G. Kucherov, Finding maximal repetitions in a word in linear time, in: IEEE Symp. Foundations of Computer Science, New York, 1999, pp. 596-604.
13. R.M. Kolpakov, G. Kucherov, Finding approximate repetitions under hamming distance, in: Proc. the Ninth European Symp. Algorithms, Lecture Notes in Computer Science, Vol. 2161, Springer, Berlin, 2001, pp. 171-180.
14. S. Kurtz, E. Ohlebusch, C. Schleiermacher, J. Stoye, R. Giegerrich, Computation and visualization of degenerate repeats in complete genome, in: Proc. Eighth Internat. Conf. Intelligent Systems for Molecular Biology, The AAAI Press, La Jolla, California, 2000, pp. 228-238.
15. G.M. Landau, J.P. Schmidt, An algorithm for approximate tandem repeats, in: A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Proc. Fourth Annu. Symp. Combinatorial Pattern Matching, Padova, Italy, Lecture Notes in Computer Science, Vol. 684, Springer, Berlin, 1993, pp. 120-133.
16. Main M.G., Lorentz R.J. An. O(n log n) algorithm for finding all repetitions in a string J. Algorithms. 5(3):1984;422-432.
17. Mouchard L. Normal forms of quasiperiodic strings. Theoret. Comput. Sci. 249(2):2000;313-324.
18. Sagot M.-F., Escalier V., Viari A., Soldano H. Searching for repeated words in a text allowing for mismatches and gaps. Baeza-Yates R., Manber U. Proc. Second South American Workshop on String Processing. 1995;101-116 Valparaiso, Chile.
19. Sagot M., Myers E.W. Identifying satellites in nucleic acid sequences. Istrail S., Pevzner P., Waterman M. Proc. Second Annu. Internat. Conf. Computational Molecular Biology (RECOMB-98). March 22-25 1998;234-242 ACM Press, New York.
20. Thue A. Über die gegenseitige lage gleicher teile gewisser zeichenreichen. Nor. Vidensk. Selsk. Skr. Mat. Nat. Kl. 1:1912;1-67.