Author:
Clifford Raphaël,Sergot Marek
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Lect Notes Comput Sci;A. Andersson,1996
2. A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Information Processing Letters, 46:293–300, 1993.
3. A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume F12 of NATO ASI Series, pages 85–96. Springer-Verlag, 1985.
4. W. I. Chang and E. L. Lawler. Sublinear expected time approximate string matching and biological applications. Algorithmica, 12:327–344, 1994.
5. R. Clifford. Indexed strings for large-scale genomic analysis. PhD thesis, Imperial College of Science Technology and Medicine, London, April 2001.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献