On the Approximation of Largest Common Subtrees and Largest Common Point Sets - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Tatsuya Akutsu, Magnús M. Halldórsson. On the Approximation of Largest Common Subtrees and Largest Common Point Sets. In Ding-Zhu Du, Xiang-Sun Zhang, editors, Algorithms and Computation, 5th International Symposium, ISAAC 94, Beijing, P. R. China, August 25-27, 1994, Proceedings. Volume 834 of Lecture Notes in Computer Science, pages 405-413, Springer, 1994.

This author has not been identified. Look up 'Tatsuya Akutsu' in GoogleThis author has not been identified. Look up 'Magnús M. Halldórsson' in Google

runs on WebDSL