On-line construction of two-dimensional suffix trees in O(n^2 n) time

DOI10.1007/S00453-007-0063-XMaRDI QIDQ2384787zbMATH OpenOpenAlexFDO

Authors Joong Chae Na, R. Giancarlo, Kunsoo Park

Publication date 10 October 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-0063-x

zbMATH Keywords

GG algorithmLcharacters

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Computing and Combinatorics
• Improving on-line construction of two-dimensional suffix trees for square matrices
• On-line construction of two-dimensional suffix trees
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction

Cited in

(12)

• Finding patterns and periods in Cartesian tree matching
• A note on a tree-based 2D indexing
• TREE-BASED 2D INDEXING
• A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
• Forty Years of Text Indexing
• Cartesian Tree Matching and Indexing
• Computing and Combinatorics
• On-line construction of two-dimensional suffix trees
• On-line construction of two-dimensional suffix trees
• Linear-time construction of two-dimensional suffix trees
• Better indexing for rectangular pattern matching
• Improving on-line construction of two-dimensional suffix trees for square matrices

This page was built for publication: On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time

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