From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
From MaRDI portal
Publication:1386367
DOI10.1007/PL00009177zbMATH Open0895.68056DBLPjournals/algorithmica/GiegerichK97WikidataQ56431600 ScholiaQ56431600MaRDI QIDQ1386367FDOQ1386367
Authors: Robert Giegerich, Stefan Kurtz 
Publication date: 24 May 1998
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
- A linear time lower bound on McCreight and general updating algorithms for suffix trees
- Linear-time construction of suffix arrays (extended abstract)
- Linear-time construction of two-dimensional suffix trees
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- On the sorting-complexity of suffix tree construction
- Linear-time period computation of a string with suffix trees
- scientific article; zbMATH DE number 2102777
- Linear-time suffix sorting -- a new approach for suffix array construction
- Sparse suffix tree construction in optimal time and space
- Fast construction of generalized suffix trees over a very large alphabet
Cited In (23)
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- A linear time lower bound on McCreight and general updating algorithms for suffix trees
- Title not available (Why is that?)
- Time optimal left to right construction of position trees
- Online Suffix Tree Construction for Streaming Sequences
- On-line suffix tree construction with reduced branching
- Collage system: A unifying framework for compressed pattern matching.
- Fast construction of generalized suffix trees over a very large alphabet
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
- On suffix extensions in suffix trees
- Title not available (Why is that?)
- Linear bidirectional on-line construction of affix trees
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
- On-line construction of suffix trees
- On-line construction of parameterized suffix trees for large alphabets
- Dynamic construction of an antidictionary with linear complexity
- Distributed suffix trees
- Near real-time suffix tree construction via the fringe marked ancestor problem
- Irredundant tandem motifs
- Truncated suffix trees and their application to data compression.
- Computing suffix links for suffix trees and arrays
- A framework for space-efficient string kernels
This page was built for publication: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386367)
