On-line construction of parameterized suffix trees for large alphabets

DOI10.1016/j.ipl.2010.11.017zbMath1260.68459OpenAlexW1992275936MaRDI QIDQ1944073

Joong Chae Na, Taehyung Lee, Kun Soo Park

Publication date: 4 April 2013

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

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

zbMATH Keywords

data structuresdesign of algorithmsrandomized algorithms

Mathematics Subject Classification ID

Data structures (68P05) Randomized algorithms (68W20)

Related Items

Order-preserving indexing ⋮ The structural border array ⋮ Variations of the parameterized longest previous factor ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Parameterized DAWGs: efficient constructions and bidirectional pattern searches ⋮ Compressed parameterized pattern matching ⋮ Finding patterns and periods in Cartesian tree matching ⋮ Parameterized longest previous factor ⋮ Unnamed Item ⋮ Efficient pattern matching for RNA secondary structures ⋮ A prefix array for parameterized strings ⋮ Unnamed Item ⋮ A brief history of parameterized matching problems ⋮ Cartesian Tree Matching and Indexing

Cites Work

• Unnamed Item
• Linear-time construction of two-dimensional suffix trees
• Improving on-line construction of two-dimensional suffix trees for square matrices
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Generalization of a suffix tree for RNA structural pattern matching
• On-line construction of suffix trees
• A Space-Economical Suffix Tree Construction Algorithm
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Faster Suffix Tree Construction with Missing Suffix Links
• A theory of parameterized pattern matching
• On the sorting-complexity of suffix tree construction