Efficient Implementation of Suffix Trees (1995)
by
Arne Andersson
,
Stefan Nilsson
| Citations: | 32 - 3 self |
BibTeX
@MISC{Andersson95efficientimplementation,
author = {Arne Andersson and Stefan Nilsson},
title = {Efficient Implementation of Suffix Trees},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this article we discuss how the suffix tree can be used for string searching
Citations
| 773 | A method for the construction of minimum-redundancy codes - Huffman - 1952 |
| 574 | Text Compression - Bell, Cleary, et al. - 1990 |
| 560 | G: Suffix arrays: a new method for on-line string searches - Manber, Myers - 1993 |
| 493 | A space-economical suffix tree construction algorithm - MCCREIGHT - 1976 |
| 269 | On-line construction of suffix trees - Ukkonen - 1995 |
| 156 | Handbook of Algorithms and Data Structures - GONNET, R - 1991 |
| 110 | The myriad virtues of subword trees - Apostolico - 1985 |
| 30 | Improved behaviour of tries by adaptive branching - Andersson, Nilsson - 1993 |
| 29 | A new efficient radix sort - Andersson, Nilsson - 1994 |
| 10 | McCreight: A space-economical suffix tree construction algorithm - M - 1976 |
