Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms, chapter 9, pages 318–361. Addison-Wesley, 1974.
2. A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Inf. Process. Lett., 46(6):295–300, July 1993.
3. A. Andersson and S. Nilsson. Efficient implementation of suffix trees. Software-Practice and Experience, 25(2):129–141, Feb. 1995.
4. A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 85–95. Springer-Verlag, 1985.
5. R. A. Baeza-Yates and G. H. Gonnet. Efficient text searching of regular expressions. In Proc. 16th International Colloquium on Automata, Languages and Programming (ICALP), pages 46–62, 1989.
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Compact and hash based variants of the suffix array;Bulletin of the Polish Academy of Sciences Technical Sciences;2017-08-01
2. Brief Review on Optimal Suffix Data Structures;Advances in Intelligent Systems and Computing;2016-11-23
3. AS-Index: A Structure for String Search Using n-Grams and Algebraic Signatures;Journal of Computer Science and Technology;2016-01
4. Locally Compressed Suffix Arrays;ACM Journal of Experimental Algorithmics;2015-02-03
5. Implementing the LZ-index;ACM Journal of Experimental Algorithmics;2009-02