Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. Bounds on the complexity of the longest common subsequences problem;Aho;J. Comput. Mach.,1976
2. Longest common subsequences of two random sequences;Chvatal;J. Appl. Probability,1975
3. V. Chvatal and D. Sankoff, Longest common subsequences of random sequences, Department of Computer Science, Stanford Univ. CS-75-477.
4. Algorithms for the longest common subsequences problem;Hirschberg;J. Assoc. Comput. Mach.,1977
5. Subadditive ergodic theory;Kingman;Ann. of Probability,1973
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献