Linear bidirectional on-line construction of affix trees
From MaRDI portal
Publication:1424249
DOI10.1007/s00453-003-1029-2zbMath1060.68145MaRDI QIDQ1424249
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
Related Items
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets, Elastic founder graphs improved and enhanced, Multi-pattern matching with bidirectional indexes, Bidirectional search in a string with wavelet trees and bidirectional matching statistics, Approximate string matching with compressed indexes