Axiomatic Concensus Theory in Group Choice and Biomathematics (Frontiers in Applied Mathematics, 29)
Axiomatic Concensus Theory in Group Choice and Biomathematics (Frontiers in Applied Mathematics, 29)
Integer Programming Approaches to Haplotype Inference by Pure Parsimony
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Haplotype inference by pure Parsimony
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
An axiomatic study of Majority-rule (+ ) and associated consensus functions on hierarchies
Discrete Applied Mathematics
| Hi-index | 0.00 |
Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree construction methods have been proposed to date, but most of these are not designed with any specific properties in mind. Recently, Cotton and Wilkinson proposed extensions of the majority-rule consensus tree method to the supertree setting that inherit many of the appealing properties of the former. Here we study a variant of one of their methods, called majority-rule (+) supertrees. After proving that a key underlying problem for constructing majority-rule (+) supertrees is NP-hard, we develop a polynomial-size integer linear programming formulation of the problem.We then report on a preliminary computational study of our approach. The results indicate that our method is computationally feasible for moderately large inputs. Perhaps more significantly, our results suggest that the majority-rule (+) approach produces biologically meaningful results.