acm.org
sci-hub.se 参考文章(19)
Daniel S. Hirschberg, The longest common subsequence problem. Princeton University. ,(1975)
M. S. Paterson, M. J. Fischer, STRING-MATCHING AND OTHER PRODUCTS Massachusetts Institute of Technology. ,(1974)
Donald E. Knuth, Vaclav Chvatal, David A. Klarner, Selected combinatorial research problems. Stanford University. ,(1972)
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Robert A. Wagner, Michael J. Fischer, The String-to-String Correction Problem Journal of the ACM. ,vol. 21, pp. 168- 173 ,(1974) , 10.1145/321796.321811
Robert A. Wagner, On the complexity of the Extended String-to-String Correction Problem Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75. pp. 218- 223 ,(1975) , 10.1145/800116.803771
David Sankoff, R.J. Cedergren, A test for nucleotide sequence homology. Journal of Molecular Biology. ,vol. 77, pp. 159- 164 ,(1973) , 10.1016/0022-2836(73)90369-0
Stephen A. Cook, The complexity of theorem-proving procedures symposium on the theory of computing. pp. 151- 158 ,(1971) , 10.1145/800157.805047
J. D. Ullman, A. V. Aho, D. S. Hirschberg, Bounds on the Complexity of the Longest Common Subsequence Problem Journal of the ACM. ,vol. 23, pp. 1- 12 ,(1976) , 10.1145/321921.321922
Robert A. Wagner, Roy Lowrance, An Extension of the String-to-String Correction Problem Journal of the ACM. ,vol. 22, pp. 177- 183 ,(1975) , 10.1145/321879.321880