Linear time algorithms for generalizations of the longest common substring problem

Algorithmica (New York)

Volumn 60, Issue 4, 2011, Pages 806-818

  Arnold, Michael ^a   Ohlebusch, Enno ^b  

^a Capgemini Sdandm AG   (Germany)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

Longest common repeat; Longest common substring; Repeat analysis; String mining; Suffix arrays

Indexed keywords

LONGEST COMMON REPEAT; LONGEST COMMON SUBSTRING; REPEAT ANALYSIS; STRING MINING; SUFFIX ARRAYS;

PATTERN MATCHING;

ALGORITHMS;

EID: 79959196151     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-009-9369-1     Document Type: Article

References (13)

1. Hui, L.C.K.: Color set size problem with applications to string matching. In: Proc. 3rd Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 644, pp. 230-243. Springer, Berlin (1992)
2. D.E. Knuth J.H. Morris V.R. Pratt 1977 Fast pattern matching in strings SIAM J. Comput. 6 2 323 350 451916 0372.68005 10.1137/0206024
3. Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words, pp. 85-96. Springer, Berlin (1985)
4. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1999)
5. Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th IEEE Annual Symposium on Switching and Automata Theory, pp. 1-11. IEEE, New York (1973)
6. I. Lee C.S. Iliopoulos K. Park 2007 Linear time algorithm for the longest common repeat problem J. Discrete Algorithms 5 2 243 249 2316548 1127.68114 10.1016/j.jda.2006.03.019 (Pubitemid 46590832)
7. I. Lee Y.J. Pinzon-Ardila 2007 A simple algorithm for finding exact common repeats IEICE Trans. 90D 12 2096 2099 10.1093/ietisy/e90-d.12.2096
8. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Proc. 30th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 2719, pp. 943-955. Springer, Berlin (2003)
9. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Proc. 14th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 2676, pp. 200-210. Springer, Berlin (2003)
10. Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Proc. 14th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 2676, pp. 186-199. Springer, Berlin (2003) (Pubitemid 36769862)
11. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Proc. 12th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 2089, pp. 181-192. Springer, Berlin (2001) (Pubitemid 33298873)
12. O. Berkman U. Vishkin 1993 Recursive star-tree parallel data structure SIAM J. Comput. 22 2 221 242 1207781 0770.68044 10.1137/0222017 (Pubitemid 23639058)
13. Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Proc. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. Lecture Notes in Computer Science, vol. 4614, pp. 459-470. Springer, Berlin (2007)