From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction

DOI10.1007/PL00009177zbMath0895.68056DBLPjournals/algorithmica/GiegerichK97WikidataQ56431600 ScholiaQ56431600MaRDI QIDQ1386367

Stefan Kurtz, Robert Giegerich

Publication date: 24 May 1998

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

program transformationsuffix treelinear-time algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (14)

Collage system: A unifying framework for compressed pattern matching. ⋮ A linear time lower bound on McCreight and general updating algorithms for suffix trees ⋮ Computing suffix links for suffix trees and arrays ⋮ A framework for space-efficient string kernels ⋮ Truncated suffix trees and their application to data compression. ⋮ On-line suffix tree construction with reduced branching ⋮ On-line construction of parameterized suffix trees for large alphabets ⋮ Irredundant tandem motifs ⋮ Dynamic construction of an antidictionary with linear complexity ⋮ On suffix extensions in suffix trees ⋮ Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays ⋮ Online Suffix Tree Construction for Streaming Sequences ⋮ Distributed suffix trees ⋮ Space-efficient representation of truncated suffix trees, with applications to Markov order estimation

This page was built for publication: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction