Author:
Arslan Abdullah N.,Eğecioğlu Ömer
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. P. Bieganski. Genetic Sequence Data Retrieval and Manipulation based on Generalized Suffix Trees. PhD thesis, University of Minnesota, 1995.
2. Lect Notes Comput Sci;G. S. Brodal,1996
3. G. S. Brodal and S. Velkatesh. Improved bounds for dictionary look-up with one error. IPL, 75, 57–59, 2000.
4. D. Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, 1997.
5. D. Dolev, Y. Harari, N. Linial, N. Nisan and M. Parnas. Neighborhood preserving hashing and approximate queries. Proceedings of the Fifth ACM SODA, 1994.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献