Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference17 articles.
1. Replacing suffix trees with enhanced suffix arrays;Abouelhoda;J. Discrete Algorithms,2004
2. Efficient string matching;Aho;Comm. ACM,1975
3. A. Andersson, S. Nilsson, A new efficient radix sort, in: Proc. 35th IEEE Symp. on Foundations of Computer Science, 1994, pp. 714–721
4. Efficient and elegant subword-tree construction;Chen,1985
5. M. Farach, Optimal suffix tree construction with large alphabets, in: Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 137–143
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献