@InProceedings{Maas00,
  author = 	 {Moritz G. Maa{\ss}},
  title = 	 {Linear Bidirectional On-Line Construction of Affix Trees},
  booktitle = 	 {Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching ({CPM})},
  pages =	 {320--334},
  year =	 2000,
  volume =	 1848,
  series =	 {LNCS},
  month =	 {jun},
  publisher =	 {Springer},
  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.},
}