Author:
Paterson Mike,Dančík Vlado
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. A. V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 5, pages 255–300. Elsevier, Amsterdam, 1990.
2. A. V. Aho, D. D. Hirschberg, and J. D. Ullman. Bounds on the complexity of the longest common subsequence problem. Journal of the Association for Computing Machinery, 23(1):1–12, 1976.
3. K. S. Alexander. The rate of convergence of the mean length of the longest common subsequences. Unpublished manuscript.
4. A. Apostolico. Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings. Information Processing Letters, 23:63–69, 1986.
5. A. Apostolico. Remark on the Hsu-Du new algorithm for the longest common subsequence problem. Information Processing Letters, 25:235–236, 1987.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献