Skip to main content
Conference Proceedings

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) (1999) 1644 LNCS 463-472
DOI: 10.1007/3-540-48523-6_43
11Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The suffix tree of a string S is a compacted trie that re- presents all suffixes of S. Linear-time algorithms for constructing the suffix tree have been known for quite a while. In two dimensions, howe- ver, linear-time construction of two-dimensional suffix trees has been an open problem.We present the first linear-time algorithm for constructing two-dimensional suffix trees. © Springer-Verlag Berlin Heidelberg 1999.

Cite

CITATION STYLE

APA

Kim, D. K., & Park, K. (1999). Linear-time construction of two-dimensional suffix trees (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1644 LNCS, pp. 463–472). Springer Verlag. https://doi.org/10.1007/3-540-48523-6_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free