On-line construction of two-dimensional suffix trees

DOI10.1006/JCOM.1998.0495zbMath0927.68023OpenAlexW2061870047MaRDI QIDQ5906373

Daniela Guaiana, Raffaele Giancarlo

Publication date: 20 July 1999

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1998.0495

zbMATH Keywords

implicit updatessuffix trees

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the construction of classes of suffix trees for square matrices: Algorithms and applications
• Parallel construction of a suffix tree with applications
• Two-dimensional dictionary matching
• Detection of periodicities and string-matching in real time
• A data structure for dynamic trees
• Improved dynamic dictionary matching
• On-line construction of suffix trees
• On the computational power of pushdown automata
• Symmetry breaking for suffix tree construction
• Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)
• Two-dimensional encoding by finite-state encoders
• Linear Algorithm for Data Compression via String Matching
• A Space-Economical Suffix Tree Construction Algorithm
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• A Generalization of the Suffix Tree to Square Matrices, with Applications
• Multiple matching of rectangular patterns
• Parallelism in random access machines
• Optimal parallel suffix tree construction

This page was built for publication: On-line construction of two-dimensional suffix trees