Linear bidirectional on-line construction of affix trees

DOI10.1007/s00453-003-1029-2zbMath1060.68145OpenAlexW2139270299MaRDI QIDQ1424249

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

pattern matchingsuffix treeamortized analysis

Mathematics Subject Classification ID

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

Related Items (5)

Approximate string matching with compressed indexes ⋮ Multi-pattern matching with bidirectional indexes ⋮ Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets ⋮ Bidirectional search in a string with wavelet trees and bidirectional matching statistics ⋮ Elastic founder graphs improved and enhanced

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