Author:
Cole Richard,Kopelowitz Tsvi,Lewenstein Moshe
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Amir, A., Kopelowitz, T., Lewenstein, M., Lewenstein, N.: Towards Real-Time Suffix Tree Construction. In: Proc. of Symp. on String Processing and Information Retrieval (SPIRE), pp. 67–78 (2005)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
3. Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th IEEE Symposium on Foundations of Computer Science, pp. 137–143 (1997)
4. Lecture Notes in Computer Science;R. Grossi,1999
5. Lecture Notes in Computer Science;J. Kärkkäinen,2003
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sequential Representation of Suffix Trie: An Empirical Evaluation;Communications in Computer and Information Science;2021
2. Suffix Arrays with a Twist;Computing and Informatics;2019
3. Compact and hash based variants of the suffix array;Bulletin of the Polish Academy of Sciences Technical Sciences;2017-08-01
4. The property suffix tree with dynamic properties;Theoretical Computer Science;2016-07
5. Dictionary Matching;Encyclopedia of Algorithms;2016