Author:
Burkhardt Stefan,Kärkkäinen Juha
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. R. Baeza-Yates and G. Gonnet. All-against-all sequence matching. Technical report, Dept. of Computer Science, University of Chile, 1990.
2. S. Burkhardt, A. Crauser, P. Ferragina, H.-P. Lenhof, E. Rivals, and M. Vingron. q-gram based database searching using a suffix array. In S. Istrail, P. Pevzner, and M. Waterman, editors, Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), pages 77–83, Lyon, France, 1999. ACM Press.
3. A. Califano and I. Rigoutsos. FLASH: A fast look-up algorithm for string homology. In L. Hunter, D. Searls, and J. Shavlik, editors, Proceedings of the First International Conference on Intelligent Systems for Molecular Biology, pages 56–64, Bethesda, MD, 1993. AAAI Press.
4. Lect Notes Comput Sci;A.L. Cobbs,1995
5. N. Holsti and E. Sutinen. Approximate string matching using q-gram places. In Proceedings of the 7th Finnish Symposium on Computer Science, pages 23–32, 1994.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献