Improving on-line construction of two-dimensional suffix trees for square matrices

DOI10.1016/j.ipl.2009.01.026zbMath1214.68460OpenAlexW2044405965MaRDI QIDQ987807

Jeong Seop Sim, Joong Chae Na, Namhee Kim, Dong Kyue Kim

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.026

zbMATH Keywords

design of algorithmson-line algorithmsrandomized algorithmsindex data structurestwo-dimensional suffix trees

Mathematics Subject Classification ID

Data structures (68P05) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

On-line construction of parameterized suffix trees for large alphabets

Cites Work

• On-line construction of suffix trees
• On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
• A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
• Efficient randomized pattern-matching algorithms
• A Space-Economical Suffix Tree Construction Algorithm
• Faster Suffix Tree Construction with Missing Suffix Links
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• On the sorting-complexity of suffix tree construction
• On-line construction of two-dimensional suffix trees

This page was built for publication: Improving on-line construction of two-dimensional suffix trees for square matrices