Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri. Approximating the Maximum Isomorphic Agreement Subtree Is Hard. In Raffaele Giancarlo, David Sankoff, editors, Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings. Volume 1848 of Lecture Notes in Computer Science, pages 119-128, Springer, 2000. [doi]
No references recorded for this publication.
No citations of this publication recorded.