V. Berry

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We propose and study the Maximum Constrained Agreement Sub-tree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows users to apply their domain knowledge to control the construction of the agreement subtrees in order to get better results. We show that the MCAST problem can be reduced to the MAST(More)
  • 1