From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction

Abstract

We review the linear-time suffix tree constructions by Weiner, McCreight, and Ukkonen. We use the terminology of the most recent algorithm, Ukkonen's on-line construction, to explain its historic predecessors. This reveals relationships much closer than one would expect, since the three algorithms are based on rather different intuitive ideas. Moreover, it completely explains the differences between these algorithms in terms of simplicity, efficiency, and implementation complexity.

DOI: 10.1007/PL00009177

9 Figures and Tables

Statistics

01020'99'01'03'05'07'09'11'13'15'17
Citations per Year

153 Citations

Semantic Scholar estimates that this publication has 153 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Giegerich1997FromUT, title={From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction}, author={Robert Giegerich and Stefan Kurtz}, journal={Algorithmica}, year={1997}, volume={19}, pages={331-353} }