On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
From MaRDI portal
Publication:2384787
DOI10.1007/s00453-007-0063-xzbMath1124.68019OpenAlexW2047375893MaRDI QIDQ2384787
Raffaele Giancarlo, Joong Chae Na, Kun Soo 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
Related Items
TREE-BASED 2D INDEXING ⋮ Linear-time construction of two-dimensional suffix trees ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Forty Years of Text Indexing ⋮ Improving on-line construction of two-dimensional suffix trees for square matrices ⋮ A Note on a Tree-Based 2D Indexing ⋮ Cartesian Tree Matching and Indexing
