Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms

Volumn 2, Issue 1 SPEC. ISS., 2004, Pages 53-86

  Abouelhoda, Mohamed Ibrahim ^a   Kurtz, Stefan ^b   Ohlebusch, Enno ^a  

^a UNIVERSITY OF ULM   (Germany)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Genome comparison; Pattern matching; Repeat analysis; Suffix array; Suffix tree

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; CACHE MEMORY; DATA STRUCTURES; ESCHERICHIA COLI; GENES; PATTERN MATCHING; QUERY LANGUAGES;

GENOME COMPARISON; REPEAT ANALYSIS; SUFFIX ARRAYS; SUFFIX TREES;

TREES (MATHEMATICS);

EID: 3242889975     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00065-0     Document Type: Article

References (34)

1. M.I. Abouelhoda, S. Kurtz, E. Ohlebusch, The enhanced suffix array and its applications to genome analysis, in: Proc. Workshop on Algorithms in Bioinformatics, in: Lecture Notes in Computer Science, vol. 2452, Springer-Verlag, Berlin, 2002, pp. 449-463.
2. M.I. Abouelhoda, E. Ohlebusch, S. Kurtz, Optimal exact string matching based on suffix arrays, in: Proc. International Symposium on String Processing and Information Retrieval, in: Lecture Notes in Computer Science, vol. 2476, Springer-Verlag, Berlin, 2002, pp. 31-43.
3. A. Apostolico, The myriad virtues of subword trees, in: Combinatorial Algorithms on Words, Springer-Verlag, Berlin, 1985, pp. 85-96.
4. M.A. Bender, M. Farach-Colton, The LCA problem revisited, in: Proc. Latin American Theoretical Informatics, 2000, pp. 88-94.
5. J. Bentley, R. Sedgewick, Fast algorithms for sorting and searching strings, in: Proc. ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 360-369.
6. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Research Report 124, Digital Systems Research Center, 1994.
7. W.I. Chang, E.L. Lawler, Sublinear approximate string matching and biological applications, Algorithmica 12 (4-5) (1994) 327-344.
8. A.L. Delcher, S. Kasif, R.D. Fleischmann, J. Peterson, O. White, S.L. Salzberg, Alignment of whole genomes, Nucl. Acids Res. 27 (1999) 2369-2376.
9. A.L. Delcher, A. Phillippy, J. Carlton, S.L. Salzberg, Fast algorithms for large-scale genome alignment and comparison, Nucl. Acids Res. 30 (11) (2002) 2478-2483.
10. P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proc. IEEE Symposium on Foundations of Computer Science, 2000, pp. 390-398.
11. P. Ferragina, G. Manzini, An experimental study of an opportunistic index, in: Proc. ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 269-278.
12. P. Ferragina, G. Manzini, On compressing and indexing data, Technical Report TR-02-01, Dipartimento di Informatica, Università di Pisa, 2002.
13. G. Gonnet, R. Baeza-Yates, T. Snider, New indices for text: PAT trees and PAT arrays, in: W. Frakes, R.A. Baeza-Yates (Eds.), Information Retrieval: Algorithms and Data Structures, Prentice-Hall, Englewood Cliffs, NJ, 1992, pp. 66-82.
14. R. Grossi, J.S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, in: Proc. ACM Symposium on the Theory of Computing, ACM Press, 2000, pp. 397-406.
15. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, New York, 1997.
16. D. Gusfield, J. Stoye, Linear time algorithms for finding and representing all the tandem repeats in a string, Report CSE-98-4, Computer Science Division, University of California, Davis, 1998.
17. M. Höhl, S. Kurtz, E. Ohlebusch, Efficient multiple genome alignment, Bioinformatics 18 (2002) S312-S320.
18. W.-K. Hon, K. Sadakane, Space-economical algorithms for finding maximal unique matches, in: Proc. Annual Symposium on Combinatorial Pattern Matching, in: Lecture Notes in Computer Science, vol. 2373, Springer-Verlag, Berlin, 2002, pp. 144-152.
19. J. Kärkkäinen, P. Sanders, Simple linear work suffix array construction, in: Proc. International Colloquium on Automata, Languages and Programming, in: Lecture Notes in Computer Science, vol. 2719, Springer-Verlag, Berlin, 2003, pp. 943-955.
20. T. Kasai, G. Lee, H. Arimura, S. Arikawa, K. Park, Linear-time longest-common-prefix computation in suffix arrays and its applications, in: Proc. Annual Symposium on Combinatorial Pattern Matching, in: Lecture Notes in Computer Science, vol. 2089, Springer-Verlag, Berlin, 2001, pp. 181-192.
21. D.K. Kim, J.S. Sim, H. Park, K. Park, Linear-time construction of suffix arrays, in: Proc. Annual Symposium on Combinatorial Pattern Matching, in: Lecture Notes in Computer Science, vol. 2676, Springer-Verlag, Berlin, 2003, pp. 186-199.
22. J. Knight, D. Gusfield, J. Stoye, The strmat software-package, 1998, http://www.cs.ucdavis.edu/~gusfield/ strmat.tar.gz.
23. P. Ko, S. Aluru, Space efficient linear time construction of suffix arrays, in: Proc. Annual Symposium on Combinatorial Pattern Matching, in: Lecture Notes in Computer Science, vol. 2676, Springer-Verlag, Berlin, 2003, pp. 200-210.
24. R. Kolpakov, G. Kucherov, Finding maximal repetitions in a word in linear time, in: Proc. Symposium on Foundations of Computer Science, IEEE Computer Society, 1999, pp. 596-604.
25. S. Kurtz, Reducing the space requirement of suffix trees, Software - Practice and Experience 29 (13) (1999) 1149-1171.
26. S. Kurtz, A time and space efficient algorithm for the substring matching problem, Technical Report, Zentrum für Bioinformatik, Universität Hamburg, 2003.
27. S. Kurtz, J.V. Choudhuri, E. Ohlebusch, C. Schleiermacher, J. Stoye, R. Giegerich, REPuter: the manifold applications of repeat analysis on a genomic scale, Nucl. Acids Res. 29 (22) (2001) 4633-4642.
28. E.S. Lander, L.M. Linton, B. Birren, C. Nusbaum, M.C. Zody, J. Baldwin, K. Devon, K. Dewar, et al., Initial sequencing and analysis of the human genome, Nature 409 (2001) 860-921.
29. U. Manber, E.W. Myers, Suffix arrays: a new method for on-line string searches, SIAM J. Comput. 22 (5) (1993) 935-948.
30. C. O'Keefe, E. Eichler, The pathological consequences and evolutionary implications of recent human genomic duplications, in: Comparative Genomics, Kluwer, Dordrecht, 2000, pp. 29-46.
31. K. Sadakane, Succinct representations of lcp information and improvements in the compressed suffix arrays, in: Proc. ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 225-232.
32. P. Weiner, Linear pattern matching algorithms, in: Proc. IEEE Annual Symposium on Switching and Automata Theory, The University of Iowa, 1973, pp. 1-11.
33. J. Ziv, A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory 23 (3) (1977) 337-343.
34. J. Ziv, A. Lempel, Compression of individual sequences via variable length coding, IEEE Trans. Inform. Theory 24 (5) (1978) 530-536.