Summary
In the following paper we are presenting a new algorithm for the on-line construction of position trees. Reading a given input string from left to right we are generating its position tree with the aid of the general concept of infix trees. An additional chain structure within the trees, called tail node connection, enables us to construct the tree within the best possible time (proportional to the number of nodes).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley Reading 1974
Bayer, Rudolf: Datenstrukturen. Fernuniversität Hagen, Fachbereich Mathematik und Informatik 1981
Güntzer, Ulrich: Datenstrukturen und Datenorganisation. Vorlesung, Technische Universität München 1984
Kempf, Michael: Effiziente Links-Rechts-Konstruktion von Positionsbäumen. Diplomarbeit, Technische Universität München, Institut für Informatik 1984
Majster, Mila E.; Reiser, Angelika: Efficient online construction and correction of position trees. SIAM J. Comput. 9, 785–807 (1980)
McCreight, Edward M.: A space-economical suffix tree construction algorithm. J. Assoc. Comput. Mach. 23, 262–272 (1976)
Weiner, Peter: Linear pattern matching algorithms. IEEE 14th Annual Symposium on Switching and Automata Theory, pp. 1–11 (1973)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kempf, M., Bayer, R. & Güntzer, U. Time optimal left to right construction of position trees. Acta Informatica 24, 461–474 (1987). https://doi.org/10.1007/BF00292114
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00292114