A Space-Economical Suffix Tree Construction Algorithm

作者：Edward M. McCreight · 发表于：Journal of the ACM · 年份：1976 · DOI：10.1145/321941.321946 · 被引用次数：1519 · 研究领域：Algorithms and Data Compression、Web Data Mining and Analysis

A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time bound as previously published algorithms, but is more economical in space. Some implementation considerations are discussed, and new work on the modification of these search trees in response to incremental changes in the strings they index (the update problem) is presented.