Space efficient linear time construction of suffix arrays

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

Volumn 2676, Issue , 2003, Pages 200-210

  Ko, Pang ^a   Aluru, Srinivas ^a  

^a Dept of Electrical and Computer Engineering ^*

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; CLUSTERING ALGORITHMS; FORESTRY; INDEXING (OF INFORMATION); PATTERN MATCHING; SORTING;

COMPUTATIONAL BIOLOGY; DIRECT ALGORITHMS; LARGE ALPHABETS; LINEAR TIME CONSTRUCTION; LINEAR-TIME ALGORITHMS; SPACE EFFICIENT; SPACE REQUIREMENTS; STRING PROCESSING;

TREES (MATHEMATICS);

EID: 35248831652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_15     Document Type: Article

References (14)

1. M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch. The enhanced suffix array and its applications to genome analysis. In 2nd Workshop on Algorithms in Bioinformatics, pages 449-63, 2002.
2. M. I. Abouelhoda, E. Ohlebusch, and S. Kurtz. Optimal exact string matching based on suffix arrays. In International Symposium on String Processing and Information Retrieval, pages 31-43. IEEE, 2002.
3. A. L. Delcher, S. Kasif, R. D. Fleischmann, J. Peterson, O. White, and S. L. Salzberg. Alignment of whole genomes. Nucleic Acids Research, 27:2369-76, 1999.
4. M. Farach and S. Muthukrishnan. Optimal logarithmic time randomized suffix tree construction. In Proc. of 23rd International Colloquium on Automata Languages and Programming, 1996.
5. D. Gusfield. Algorithms on Strings Trees and Sequences. Cambridge University Press, New York, New York, 1997.
6. H. Itoh and H. Tanaka. An efficient method for in memory construction of suffix array. In International Symposium on String Processing and Information Retrieval, pages 81-88. IEEE, 1999.
7. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-time longest-common-prefix computation in suffix arrays and its applications. In 12th Annual Symposium, Combinatorial Pattern Matching, pages 181-92, 2001.
8. J. Kärkkänen and P. Sanders. Simpler linear work suffix array construction. In International Colloquium on Automata, Languages and Programming, page to appear, 2003.
9. D. K. Kim, J. S. Sim, H. Park, and K. Park. Linear-time construction of suffix arrays. In 14th Annual Symposium, Combinatorial Pattern Matching, 2003.
10. N. J. Larsson and K. Sadakane. Faster suffix sorting. Technical Report LU-CS-TR:99-214, LUNDFD6/(NFCS-3140)/1-20/(1999), Department of Computer Science, Lund University, Sweden, May 1999.
11. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262-72, 1976.
12. U. Manber and G. Myers. Suffix arrays: a new method for on-line search. SIAM Journal on Computing, 22:935-48, 1993.
13. E. Ukkonen. On-line construction of suffix-trees. Algorithmica, 14:249-60, 1995.
14. P. Weiner. Linear pattern matching algorithms. In 14th Symposium on Switching and Automata Theory, pages 1-11. IEEE, 1973.