Linear Bidirectional On-Line Construction of Affix Trees

Authors:
Moritz G. Maaß
Affiliations:
-
Venue:
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Year:
2000

Citing 5
Cited 1

Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)

On-line suffix tree construction with reduced branching

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Affix trees are a generalization of suffix trees that is 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 has linear time complexity.