Linear-time construction of two-dimensional suffix trees (extended abstract)

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

Volumn 1644 LNCS, Issue , 1999, Pages 463-472

  Kim, Dong Kyue ^a   Park, Kunsoo ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CLUSTERING ALGORITHMS; FORESTRY;

EXTENDED ABSTRACTS; LINEAR TIME CONSTRUCTION; LINEAR-TIME ALGORITHMS; SUFFIX-TREES; TWO-DIMENSION; TWO-DIMENSIONAL SUFFIX TREES;

TREES (MATHEMATICS);

EID: 84887492893     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_43     Document Type: Conference Paper

References (21)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. A. Amir and M. Farach, Two-dimensional dictionary matching, Inform. Processing Letters 21 (1992), 233{239.
3. A. Apostolico, The myriad virtues of subword trees, Combinatorial Algorithms on Words, Springer-Verlag, (1985), 85-95.
4. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1994.
5. M. Farach, Optimal suffix tree construction with large alphabets, IEEE Symp. Found. Computer Science (1997), 137{143.
6. M. Farach and S. Muthukrishnan, Optimal logarithmic time randomized suffix tree construction, Int. Colloq. Automata Languages and Programming (1996), 550{561.
7. R. Giancarlo, A generalization of the suffix tree to square matrices with application, SIAM J. Comput. 24, (1995), 520{562.
8. R. Giancarlo and R. Grossi, Parallel construction and query of suffix trees for two- dimensional matrices, ACM Symposium on Parallel Algorithms and Architectures (1993), 86{97.
9. R. Giancarlo and R. Grossi, On the construction of classes of suffix trees for square matrices: Algorithms and applications, Information and Computation 130 (1996), 151{182.
10. R. Giancarlo and R. Grossi, Suffix Tree Data Structures for Matrices. Chap. 11 in Pattern Matching Algorithms, A. Apostolico and Z. Galil eds, Oxford University Press, (1997), 293{340.
11. G.H. Gonnet, Efficient searching of text and pictures, Technical report, Univ. of Waterloo OED-88-02, (1988).
12. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984), 338{355.
13. R. Hariharan, Optimal parallel suffix tree construction, IEEE Symp. Found. Computer Science (1994), 290{299.
14. D.K. Kim, Y.A. Kim, and K. Park, Constructing suffix arrays for multi- dimensional matrices, Symp. Combinatorial Pattern Matching (1998), 249{260.
15. U. Manber and G. Myers, Sufix arrays: A new method for on-line string searches, SIAM J. Comput. 22, (1993), 935{938.
16. E.M. McCreight, A space-economical suffix tree construction algorithms, J. Assoc. Comput. Mach. 23 (1976), 262{272.
17. S.C. Sahinalp and U. Vishkin, Symmetry breaking for suffix tree construction, IEEE Symp. Found. Computer Science (1994), 300{309.
18. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17, (1988), 1253{1262.
19. D.D. Sleater and R.E. Tarjan, A data structure for dynamic trees, J. Comput. System Sci. 26, (1983), 362{391.
20. E. Ukkonen, On-line construction of suffix trees, Algorithmica 14 (1995), 249{260.
21. P. Weiner, Linear pattern matching algorithms, Proc. 14th IEEE Symp. Switching and Automata Theory (1973), 1{11.