Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. A. Aho, J. Hopcroft, and J. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.
2. K. Alexander. The rate of convergence of the mean length of the longest common subsequence. Manuscript, Univ. Southern Cal. 1992.
3. A. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof Verification and Hardness of Approximation Problems. Proc. 33rd IEEE Symp. Found. Comp. Sci., 1992, 14–23.
4. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis. Linear approximation of shortest superstrings. Proc. 23rd ACM Symp. on Theory of Computing, 1991, 328–336. Also to appear in J. ACM.
5. V. Chvátal and D. Sankoff. Longest common subsequences of two random sequences. J. Appl. Probab. 12(1975), 306–315.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献