The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Towards a Data Reduction for the Minimum Flip Supertree Problem
[article]
2011
arXiv
pre-print
In computational phylogenetics, the problem of constructing a supertree of a given set of rooted input trees can be formalized in different ways, to cope with contradictory information in the input. We consider the Minimum Flip Supertree problem, where the input trees are transformed into a 0/1/?-matrix, such that each row represents a taxon, and each column represents an inner node of one of the input trees. Our goal is to find a perfect phylogeny for the input matrix requiring a minimum
arXiv:1104.4471v1
fatcat:kxjx5hmacrd2jksreoh3plccjq