Subject
General Computer Science,Theoretical Computer Science
Reference58 articles.
1. Bounds on the complexity of the longest common subsequence problem;Aho;J. ACM,1976
2. T. Akutsu, M.M. Halldórsson. On the approximation of largest common point sets and largest common subtrees, in: Proc. 5th Ann. Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science (LNCS), Vol. 834. Springer, Berlin, 1994, pp. 405–413.
3. Proc. Mathematical Foundations of Computer Science;Alonso,1993
4. Proof verification and hardness of approximation problems;Arora,1992
5. Meaningful change detection in structured data;Chawathe,1997
Cited by
471 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献