A Simple Construction of Two-Dimensional Suffix Trees in Linear Time

DOI10.1007/978-3-540-73437-6_35MaRDI QIDQ3506936zbMATH OpenOpenAlexFDO

Authors Dong Kyue Kim, Joong Chae Na, J. S. Sim, Kunsoo Park

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_35

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Linear-time construction of two-dimensional suffix trees
• On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
• Computing and Combinatorics
• On-line construction of two-dimensional suffix trees
• On-line construction of two-dimensional suffix trees
• Two Efficient Algorithms for Linear Time Suffix Array Construction
• Improving on-line construction of two-dimensional suffix trees for square matrices
• Linear-time construction of suffix arrays (extended abstract)
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Linear-time period computation of a string with suffix trees

Cited in

(5)

• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Computing and Combinatorics
• On-line construction of two-dimensional suffix trees
• Linear-time construction of two-dimensional suffix trees
• Improving on-line construction of two-dimensional suffix trees for square matrices

This page was built for publication: A Simple Construction of Two-Dimensional Suffix Trees in Linear Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506936)