The tree compatibility problem is a problem arising in the theory of computational biology. For a species set S, the problem asks whether /spl tau/, a family of trees on S, is compatible, in the sense that there is a single tree T from which each tree of the family can be derived by a sequence of edge contractions. Steel (1992) demonstrated that this problem is NP-complete if /spl tau/ is a family of unrooted trees. Polynomial time algorithms exist when /spl tau/ is a finite family of rooted trees. In this paper, we present an algorithm for constructing a rooted tree from a set of constraints on subsets of a set of elements. We then apply this algorithm to synthesize a rooted supertree, compatible with two given rooted trees.
展开▼
机译：树兼容性问题是计算生物学理论中出现的问题。对于某种物种S，问题询问了S的族族族兼容，从中兼容，从中兼容，可以通过一系列边缘导出家庭的每棵树的单树T.收缩。钢铁（1992）展示了这个问题是NP-Theation If / Spl Tau /是一个巨大的树木。存在多项式时间算法，当/拼接以时/是一个有限的植根树。在本文中，我们介绍了一种从一组元素的子集上的一组约束构造rooted树的算法。然后，我们将该算法应用于扎根卓人，与两个给定的根树兼容。
展开▼
