Forty Years of Suffix Trees

Abstract : This paper reviews the first 40 years in the life of suffix trees, their many incarnations, and their applications. The paper is non-technical but assumes some familiarity with the structures and constructions discussed. It is not meant to be exhaustive. It is meant to be a tribute to a ubiquitous tool of string matching — the suffix tree and its variants — and one of the most persistent subjects of study in the theory of algorithms.
Document type :
Journal articles
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01830856
Contributor : Maxime Crochemore <>
Submitted on : Friday, July 27, 2018 - 9:02:17 AM
Last modification on : Friday, August 9, 2019 - 3:24:03 PM
Long-term archiving on : Monday, October 1, 2018 - 5:49:16 PM

File

ACFGM-20150621.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alberto Apostolico, Maxime Crochemore, Martín Farach-Colton, Zvi Galil, S. Muthukrishnan. Forty Years of Suffix Trees. Communications- ACM, Association for Computing Machinery, 2016, 59 (4), pp.66-73. ⟨10.1145/2810036⟩. ⟨hal-01830856⟩

Share

Metrics

Record views

38

Files downloads

98