English»Algorithms»String Dictionaries and Suffix Trees | searchivarius.org
log in | about 

A taxonomy of suffix array construction algorithms  SJ Puglisi, WF Smyth, AH Turpin
Bidirectional construction of suffix trees  Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda†, Setsuo Arikawa -

A very important data structure: a bi-directional suffix tree

Dictionaries Using Variable-Length Keys and Data, with Applications  Daniel Blandford, Guy Blelloch
Dotted Suffix Trees A Structure for Approximate Text Indexing  Luís Pedro Coelho, Arlindo L. Oliveira
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications  Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park
Sparse Suffix Trees  Juha Kärkkäinen, Esko Ukkonen
Suffix arrays: A new method for on-line string searches  Udi Manber. Gene Myers. - A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper.