Faster Suffix Tree Construction with Missing Suffix Links

DOI10.1137/S0097539701424465MaRDI QIDQ4441899zbMATH OpenOpenAlexFDO

Authors Ramesh Hariharan, Richard Cole

Publication date 8 January 2004

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539701424465

zbMATH Keywords

dynamic perfect hashingparameterized stringssuffix treetwo-dimensional suffix trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Faster suffix tree construction with missing suffix links
• On-line construction of suffix trees
• scientific article; zbMATH DE number 2102777
• On-line construction of parameterized suffix trees for large alphabets
• Suffix trees on words

Cited in

(16)

• On-line construction of parameterized suffix trees for large alphabets
• A brief history of parameterized matching problems
• Weighted approximate parameterized string matching
• Order-preserving indexing
• Faster suffix tree construction with missing suffix links
• The structural border array
• On-line suffix tree construction with reduced branching
• Parameterized longest previous factor
• Sufficient conditions for efficient indexing under different matchings
• A prefix array for parameterized strings
• Structural Pattern Matching - Succinctly.
• Linear-time construction of two-dimensional suffix trees
• Breaking a barrier in constructing compact indexes for parameterized pattern matching
• LF successor: compact space indexing for order-isomorphic pattern matching
• Fast computation of k-runs, parameterized squares, and other generalised squares
• Improving on-line construction of two-dimensional suffix trees for square matrices

This page was built for publication: Faster Suffix Tree Construction with Missing Suffix Links

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