O (n2 log n) time on-line construction of two-dimensional suffix trees

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 273-282

  Na, Joong Chae ^a   Giancarlo, Raffaele ^b   Park, Kunsoo ^a  

^a Seoul National University   (South Korea)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATRIX ALGEBRA; ONLINE SYSTEMS; COMBINATORIAL MATHEMATICS; FORESTRY;

COMPUTATIONAL BOTTLENECKS; OPTIMAL UNBOUNDED ALPHABETS; SQUARE SUBMATRICES; TWO-DIMENSIONAL SUFFIX TREES; ON-LINE ALGORITHMS; ONLINE VERSIONS; PRIMITIVE OPERATIONS; SQUARE MATRICES; TIME ALGORITHMS;

TREES (MATHEMATICS);

EID: 26844502859     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_29     Document Type: Conference Paper

References (20)

1. A. Amir and M. Farach-Colton. Two-dimensional matching algorithms. In A. Apostolico and Z. Galil, editors, Pattern Matching Algorithms, pages 267-292. Oxford University Press, Oxford, 1997.
2. A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 85-95. Springer, 1985.
3. M.T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of F, pages 97-107. NATO Advanced Science Institutes, Spring-Verlag, 1985.
4. R. Cole and R. Hariharan. Dynamic LCA queries on trees. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pages 235-244, 1999.
5. R. Cole and R. Hariharan. Faster suffix tree construction with missing suffix links. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 407-415, 2000.
6. M. Crochemore and W. Rytter. Jewels of Stringology. World Scientific Publishing, Singapore, 2002.
7. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. On the sorting-complexity of suffix tree construction. Journal of the ACM, 47(6):987-1011, 2000.
8. R. Giancarlo. An index data structure for matrices, with applications to fast two-dimensional pattern matching. In Proceedings of Workshop on Algorithm and Data Structures, pages 337-348. Springer-Verlag, 1993.
9. R. Giancarlo. A generalization of the suffix tree to square matrices, with application. SIAM Journal on Computing, 24 (3):520-562, 1995.
10. R. Giancarlo and R. Grossi. On the construction of classes of suffix trees for square matrices: Algorithms and applications. Information and Computation, 130(2):151-182, 1996.
11. R. Giancarlo and R. Grossi. Suffix tree data structures for matrices. In A. Apostolico and Z. Galil, editors, Pattern Matching Algorithms, chapter 11, pages 293-340. Oxford University Press, Oxford, 1997.
12. R. Giancarlo and D. Guaiana. On-line construction of two-dimensional suffix trees. Journal of Complexity, 15(1):72-127, 1999.
13. D. Gusfield. Algorithms on Strings, Tree, and Sequences. Cambridge University Press, Cambridge, 1997.
14. D. K. Kim, Y. A. Kim, and K. Park. Generalizations of suffix arrays to multi-dimensional matrices. Theoretical Computer Science, 302(1-3):401-416, 2003.
15. D. K. Kim and K. Park. Linear-time construction of two-dimensional suffix trees. In Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, pages 463-372, 1999.
16. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
17. E. M. McCreight. A space-economical suffix tree construction algorithms. Journal of the ACM, 23(2):262-272, 1976.
18. J. A. Storer. Lossless image compression using generalized LZ1-type methods. In Proceedings of Data Compression Conference, pages 290-299, 1996.
19. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
20. P. Weiner. Linear pattern matching algorithms. In Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.