Computing longest common substrings via suffix arrays

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

Volumn 5010 LNCS, Issue , 2008, Pages 64-75

  Babenko, Maxim A ^a   Starikovskaya, Tatiana A ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TIME ALGORITHMS; SUFFIX ARRAYS;

ALGORITHMS; COMPUTATIONAL METHODS; QUERY PROCESSING; WORD PROCESSING;

PROBLEM SOLVING;

EID: 44649115254     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79709-8_10     Document Type: Conference Paper

References (9)

1. Aho, A.V., Ullman, J.D., Hopcroft, J.E.: The design and analysis of computer algorithms. Addison-Wesley, Reading, MA (1974)
2. Bender, M., Farach-Colton, M.: The LCA problem revisited, pp. 88-94 (2000)
3. Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific Publishing Co. Inc., River Edge, NJ (2003)
4. Gusfield, D.: Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, New York, NY, USA (1997)
5. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181-192. Springer, Heidelberg (2001)
6. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719. Springer, Heidelberg (2003)
7. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. In: SODA 1990: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 319-327 (1990)
8. Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Comput. Surv. 39(2), 4 (2007)
9. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249260 (1995)