The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
[article]
2008
arXiv
pre-print
Consider a set of labels L and a set of trees T = { T^(1), T^(2), ..., T^(k) where each tree T^(i) is distinctly leaf-labeled by some subset of L. One fundamental problem is to find the biggest tree (denoted as supertree) to represent T which minimizes the disagreements with the trees in T under certain criteria. This problem finds applications in phylogenetics, database, and data mining. In this paper, we focus on two particular supertree problems, namely, the maximum agreement supertree
arXiv:0802.2867v1
fatcat:gdlxa4c2gvhp7fgqrv6kcyqyaq