Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Apostolico, A. and C. Guerra, The longest common subsequence problem revisited, Algorithmica, Vol. 2, 1987, pp. 315–336.
2. Chin, F. Y. L. and C. K. Poon, A fast algorithm for computing longest common subsequences of small alphabet size, J. of Info. Proc., Vol. 13, No.4, 1990, pp. 463–469.
3. Hirschberg, D. S., A linear space algorithm for computing maximal common subsequences, Comm. ACM, Vol. 18, 1975, pp. 341–343.
4. Hirschberg, D. S., Algorithms for the longest common subsequence problem, J. ACM, Vol. 24, 1977, pp. 664–675.
5. Hunt, J. W. and T. G. A. Szymanski, A fast algorithm for computing longest common subsequences, Comm. ACM, Vol. 20, 1977, pp. 350–353.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献