Linear time algorithms for finding and representing all the tandem repeats in a string

Journal of Computer and System Sciences

Volumn 69, Issue 4, 2004, Pages 525-546

  Gusfield, Dan ^a   Stoye, Jens ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; PATTERN RECOGNITION; THEOREM PROVING; WORD PROCESSING;

LINEAR TIME ALGORITHMS; TANDEM ARRAYS; TANDEM REPEATS;

COMPUTER SCIENCE;

EID: 6344252888     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.03.004     Document Type: Article

References (21)

1. Apostolico A., Preparata F.P. Optimal off-line detection of repetitions in a string. Theoret. Comput. Sci. 22:1983;297-315.
2. Crochemore M. An optimal algorithm for computing the repetitions in a word. Inform. Process. Lett. 12(5):1981;244-250.
3. Crochemore M. Recherche linéaire d'un carré dans un mot. C. R. Acad. Sci. Paris. 296:1983;781-784.
4. Crochemore M. Tranducers and repetitions. Theoret. Comput. Sci. 45:1986;63-86.
5. Crochemore M., Rytter W. Text Algorithms. 1994;Oxford University Press, New York.
6. M. Farach, Optimal suffix tree construction with large alphabets, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS 97, IEEE Press, New York, 1997, pp. 137-143.
7. Fraenkel A.S., Simpson J. How many squares can a string contain? J. Combin. Theory Ser. A. 82:1998;112-120.
8. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. 1997;Cambridge University Press, New York.
9. D. Hickerson, Preprint, 2003.
10. R. Kolpakov, G. Kucherov, in: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS 99, IEEE Press, New York, 1999, pp. 596-604.
11. S.R. Kosaraju, Computation of squares in a string, in: Proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, CPM 94, Lecture Notes in Computer Science, Vol. 807, Springer, Berlin, 1994, pp. 146-150.
12. G.M. Landau, J.P. Schmidt, An algorithm for approximate tandem repeats, in: Proceedings of the Fourth Annual Symposium on Combinatorial Pattern Matching, CPM 93, Lecture Notes in Computer Science, Vol. 684, Springer, Berlin, 1993, pp. 120-133.
13. Lempel A., Ziv J. On the complexity of finite sequences. IEEE Trans. Inform. Theory. 22(1):1976;75-81.
14. Main M.G. Detecting leftmost maximal periodicities. Discrete Appl. Math. 25:1989;145-153.
15. Main M.G., Lorentz R.J. An. O(n log n) algorithm for finding all repetitions in a string J. Algorithms. 5:1984;422-432.
16. M.G. Main, R.J. Lorentz, Linear time recognition of squarefree strings, in: A. Apostolico, Z. Galil (Eds.), Combinatorial Algorithms on Words, NATO ASI Series, Vol. F12, Springer, Berlin, 1985, pp. 271-278.
17. McCreight E.M. A space-economical suffix tree construction algorithm. J. ACM. 23(2):1976;262-272.
18. Rodeh M., Pratt V.R., Even S. Linear algorithm for data compression via string matching. J. ACM. 28(1):1981;16-24.
19. Stoye J., Gusfield D. Simple and flexible detection of contiguous repeats using a suffix tree. Theoret. Comput. Sci. 270(1-2):2002;843-856.
20. Ukkonen E. On-line construction of suffix trees. Algorithmica. 14:1995;249-260.
21. P. Weiner, Linear pattern matching algorithms, in: IEEE 14th Annual Symposium on Switching and Automata Theory, IEEE Press, New York, 1973, pp. 1-11.