Linear bidirectional on-line construction of affix trees

DOI10.1007/S00453-003-1029-2MaRDI QIDQ1424249zbMATH OpenOpenAlexFDO

Authors Moritz G. Maaß

Publication date 11 March 2004

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-003-1029-2

zbMATH Keywords

amortized analysispattern matchingsuffix tree

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1615290
• On-line construction of suffix trees
• Time optimal left to right construction of position trees
• scientific article; zbMATH DE number 2052919
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction

Cited in

(6)

• Approximate string matching with compressed indexes
• scientific article; zbMATH DE number 1615290 (Why is no real title available?)
• Multi-pattern matching with bidirectional indexes
• Bidirectional search in a string with wavelet trees and bidirectional matching statistics
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Elastic founder graphs improved and enhanced

This page was built for publication: Linear bidirectional on-line construction of affix trees

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