Author:
Ito Minoru,Shimizu Kuniyasu,Nakanishi Michio,Hashimoto Akihiro
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. R.S.Boyer and J.S.Moore: “A fast string searching algorithm,” Comm. ACM, 20, 10, pp.762–772 (Oct. 1977).
2. R.Dular, R.Kajioka and S.Kasatiya: “Comparison of Gene-Probe Commercial Kit and Culture Technique for the Diagnosis of Mycoplasma pneumoniae Infection,” Journal of Clinical Microbiology, 26, 5, pp.1068–1069 (May 1988).
3. M.Hasidume, M.Ito, M.Nakanishi and A.Hashimoto: “A linear-time algorithm for computing a shortest characteristic substring of strings” (in Japanese), IEICE Technical Report, COMP93-36, pp.39–46 (July 1993).
4. D.G.Higgins and P.M.Sharp: “Fast and sensitive multiple sequence alignments on a microcomputer,” CABIOS, 5, 2, pp.151–153 (Apr. 1989).
5. D.E.Knuth, J.H.Morris and V.R. Pratt: “Fast pattern matching in strings,” SIAM Journal on Computing, 6, 2, pp.323–350 (June 1977).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献