From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction (1997) [49 citations — 6 self]
by
Robert Giegerich
,
Stefan Kurtz
Algorithmica
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Giegerich97fromukkonen,
author = {Robert Giegerich and Stefan Kurtz},
title = {From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction},
journal = {Algorithmica},
year = {1997},
volume = {19},
pages = {331--353}
}
author = {Robert Giegerich and Stefan Kurtz},
title = {From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction},
journal = {Algorithmica},
year = {1997},
volume = {19},
pages = {331--353}
}
Years of Citing Articles
Bookmarks
OpenURL
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 online 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.
Citations
| 598 | Data Structures and Algorithms – Aho, Hopcroft, et al. - 1987 |
| 341 | Efficient string matching: an aid to bibliographic search – Aho, Corasick - 1975 |
| 100 | Algorithms for finding patterns in strings – Aho - 1990 |
| 88 | The myriad virtues of subword trees – Apostolico - 1985 |
| 82 | The smallest automaton recognizing the subwords of a text – Blumer, Blumer, et al. - 1985 |
| 40 | Approximate String Matching in Sublinear Expected Time – Chang, Lawler - 1990 |
| 30 | E#cient and Elegant Subword Tree construction – Chen, Seiferas - 1985 |
| 26 | Self-Alignments in Words and Their Applications – Apostolico, Szpankowski - 1992 |
| 12 | Combinatorial Algorithms on Words – Apostolico, Galil - 1985 |
| 11 | Introduction to Algorithms. MIT-Press – Cormen, Leiserson, et al. - 1990 |
| 8 | String matching with constraints – Crochemore - 1988 |
| 3 | String searching algorithms – Baeza-Yates - 1992 |
