Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference17 articles.
1. A. V. Aho, D. S. Hirschberg, and J. D. Ullman, Bounds on the complexity of the maximal common subsequence problem,J. Assoc. Comput. Mach.,23 (1976), 1–12.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1976
3. A. Apostolico, Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings,Inform. Process. Lett.,23 (1986), 63–69.
4. A. Apostolico and C. Guerra, A fast linear space algorithm for computing longest common subsequences,Proceedings of the 23rd Allerton Conference, Monticello, IL, 1985, pp. 76–84.
5. J. L. Bentley and A. C.-C. Yao, An almost optimal algorithm for unbounded searching,Inform. Process. Lett.,5 (1976), 82–87.
Cited by
126 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献