Abstract
Affix trees are a generalization of suffix trees that are based on the inherent duality of suffix trees induced by the suffix links. An algorithm is presented that constructs affix trees on-line by expanding the underlying string in both directions and that is the first known algorithm to do this with linear time complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Maaß Linear Bidirectional On-Line Construction of Affix Trees . Algorithmica 37, 43–74 (2003). https://doi.org/10.1007/s00453-003-1029-2
Issue Date:
DOI: https://doi.org/10.1007/s00453-003-1029-2