Forty Years Of Text Indexing
COMBINATORIAL PATTERN MATCHING(2013)
摘要
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.
更多查看译文
关键词
pattern matching, string searching, bi-tree, suffix tree, dawg, suffix automaton, factor automaton, suffix array, FM-index, wavelet tree
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要