Affiliation:
1. Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
906 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On suffix tree detection;Theoretical Computer Science;2024-10
2. Privacy-preserving federated discovery of DNA motifs with differential privacy;Expert Systems with Applications;2024-09
3. Random subsequence forests;Information Sciences;2024-05
4. τλ-Index: Locating Rare Patterns in Similar Strings;2024 Data Compression Conference (DCC);2024-03-19
5. Flanked Block-Interchange Distance on Strings;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2024-03