Name
Abstract | ||
|---|---|---|
This paper reviews the first 40 years in the life of textual inverted indexes, their many incarnations, and their applications. The paper is non-technical and 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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-38905-4_1 | COMBINATORIAL PATTERN MATCHING |
Keywords | Field | DocType |
pattern matching, string searching, bi-tree, suffix tree, dawg, suffix automaton, factor automaton, suffix array, FM-index, wavelet tree | String searching algorithm,Suffix automaton,Computer science,Theoretical computer science,Natural language processing,Artificial intelligence,FM-index,Generalized suffix tree,Suffix tree,Trie,Discrete mathematics,Suffix array,Compressed suffix array | Conference |
Volume | ISSN | Citations |
7922 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 39 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Apostolico | 1 | 1441 | 182.20 |
| Maxime Crochemore | 2 | 2655 | 281.75 |
| Martin Farach-Colton | 3 | 2402 | 178.67 |
| Zvi Galil | 4 | 3634 | 1426.98 |
| S. Muthukrishnan | 5 | 8025 | 734.98 |