Linear Bidirectional On-Line Construction of Affix Trees
- 119 Downloads
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.
KeywordsAlgorithms and data structures Pattern matching Affix tree Suffix tree Amortized analysis
Unable to display preview. Download preview PDF.