Linear Bidirectional On-Line Construction of Affix Trees

@article{Maa2003LinearBO,
  title={Linear Bidirectional On-Line Construction of Affix Trees},
  author={Moritz G. Maa\ss},
  journal={Algorithmica},
  year={2003},
  volume={37},
  pages={43-74}
}
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. 
Highly Cited
This paper has 39 citations. REVIEW CITATIONS
26 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Affixbäume. Master’s thesis, Universität Bielefeld

  • J. Stoye
  • 1995
Highly Influential
7 Excerpts

Affix Trees

  • J. Stoye
  • Technical Report 2000-04, Universität Bielefeld…
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…