## Efficient Implementation of Suffix Trees (1995)

Citations: | 34 - 3 self |

### BibTeX

@MISC{Andersson95efficientimplementation,

author = {Arne Andersson and Stefan Nilsson},

title = {Efficient Implementation of Suffix Trees},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### Abstract

this article we discuss how the suffix tree can be used for string searching

### Citations

942 |
A method for the construction of minimum redundancy codes
- Huffman
- 1952
(Show Context)
Citation Context ... in the ASCII-code will increase the search time in the binary 2 In fact, any non-periodic string may be used. trie, even when path compression is used. Therefore we suggest the use of Huffman coding =-=[5]-=-, the easiest and most well known data compression method. Huffman coding has the advantage of generating more evenly distributed binary strings and hence we will get a well balanced LC-trie with high... |

644 | Suffix arrays: a new method for on-line string searches
- Manber, Myers
- 1990
(Show Context)
Citation Context ...suffix tree. This data structure has a wide range of applications, including approximate string matching, compression schemes, and genetic sequences. The papers by Apostolico [2] and Manber and Myers =-=[3]-=- contain extensive lists of references. In this article we discuss how the suffix tree can be used for string searching. We examine an unconventional representation of a trie, which uses adaptive bran... |

617 |
Text Compression
- Bell, Cleary, et al.
- 1990
(Show Context)
Citation Context ...rformance of the LC-trie. In addition to the texts from the experiment above we have performed experiments on a selection of the standard texts found in the Calgary/Canterbury text compression corpus =-=[9]-=-. Pictures, geophysical data, object code and texts that were too large to be easily handled by our simulation program have been excluded. The following additional texts were used: bib: Bibliographic ... |

548 |
A spaceâ€“economical suffix tree construction algorithm
- McCreight
- 1976
(Show Context)
Citation Context ...is starts by constructing an ordinary suffix tree, i.e. a path-compressed k-ary trie, containing all sistrings of the text. There are several algorithms that do this in O(n log k) time and O(n) space =-=[6, 7]-=-. We also assume that the text ends with a special end marker and we assume that the binary encodings of the characters are of equal length. The LC-trie can now be constructed in two steps. First, eac... |

328 | On-line construction of suffix trees
- Ukkonen
- 1995
(Show Context)
Citation Context ...is starts by constructing an ordinary suffix tree, i.e. a path-compressed k-ary trie, containing all sistrings of the text. There are several algorithms that do this in O(n log k) time and O(n) space =-=[6, 7]-=-. We also assume that the text ends with a special end marker and we assume that the binary encodings of the characters are of equal length. The LC-trie can now be constructed in two steps. First, eac... |

162 |
Handbook of Algorithms and Data Structures
- Gonnet
- 1984
(Show Context)
Citation Context ... step where we build a data structure to speed up searches. A comprehensive survey of string searching in preprocessed text can be found in Section 7.2 of "Handbook of Algorithms and Data Structu=-=res" [1]-=-. A common method to accelerate string searching is to store references to all sistrings of the text in a trie. A sistring (semi-infinite string) is a substring of the text, defined by its starting po... |

115 | The myriad virtues of subword trees - Apostolico - 1985 |

32 | Improved Behaviour of Tries by Adaptive Branching
- Andersson, Nilsson
- 1993
(Show Context)
Citation Context ...nal representation of a trie, which uses adaptive branching; the number of descendants of a node depends on how the elements are distributed. This data structure, the level-compressed trie or LC-trie =-=[4]-=-, constitutes an efficient representation of a binary trie. We show that this new approach, when combined with other standard compression methods, gives a fast and compact data structure that is easy ... |

30 | A new efficient radix sort
- Andersson, Nilsson
- 1994
(Show Context)
Citation Context ...f the text and sort this array using a standard sorting algorithm, such as the n log n time suffix sort algorithm by Manber and Myers [3] or a fast string sorting algorithm such as Forward Radix Sort =-=[8]-=-. Given this sorted array, it is easy to make a top-down construction of the LC-trie. The algorithm is quite easy to implement, but it has a quadratic worst case running time. However, we found this a... |

10 | McCreight: A space-economical suffix tree construction algorithm - M - 1976 |