Faster Suffix Tree Construction with Missing Suffix Links

DOI10.1137/S0097539701424465zbMath1069.68644OpenAlexW1985802983MaRDI QIDQ4441899

Ramesh Hariharan, Richard John 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

suffix treeparameterized stringstwo-dimensional suffix treesdynamic perfect hashing

Mathematics Subject Classification ID

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

Related Items (12)

Order-preserving indexing ⋮ Fingerprints in compressed strings ⋮ Weighted approximate parameterized string matching ⋮ The structural border array ⋮ Linear-time construction of two-dimensional suffix trees ⋮ On-line construction of parameterized suffix trees for large alphabets ⋮ Parameterized longest previous factor ⋮ A prefix array for parameterized strings ⋮ Unnamed Item ⋮ Improving on-line construction of two-dimensional suffix trees for square matrices ⋮ A brief history of parameterized matching problems ⋮ Structural Pattern Matching - Succinctly.

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