Author:
Shikder Rayhan,Thulasiraman Parimala,Irani Pourang,Hu Pingzhao
Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
General Biochemistry, Genetics and Molecular Biology,General Medicine
Reference19 articles.
1. Ullman JD, Aho AV, Hirschberg DS. Bounds on the complexity of the longest common subsequence problem. J ACM. 1976;23:1–12.
2. Wagner RA, Fischer MJ. The string-to-string correction problem. J ACM. 1974;21:168–73.
3. Maier D. The complexity of some problems on subsequences and supersequences. J ACM. 1978;25:322–36.
4. Garey MR, Johnson DS. Computers and intractability: A guide to the theory of np-completeness (series of books in the mathematical sciences), ed. Comput Intractability. 1979. p. 340.
5. Ossman M, Hussein LF. Fast longest common subsequences for bioinformatics dynamic programming. Population (Paris). 2012;5:7.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献