Split-based computation of majority-rule supertrees.
Abstract
The presented framework allows for an efficient score computation of three majority-rule supertree variants and input trees. I combined the score computation with a heuristic search over the supertree space. The implementation was tested by simulation and on real data sets and showed promising results. Especially the MR(-) variant seems to be a reasonable score for supertree reconstruction. Generalizing these computations to multifurcating trees is an open problem, which may be tackled using this framework.

- Kupczok, Anne

Shortfacts
Category |
Journal Paper |
Divisions |
Bioinformatics and Computational Biology |
Journal or Publication Title |
BMC Evolutionary Biology |
ISSN |
1471-2148 |
Page Range |
p. 205 |
Number |
- |
Volume |
11 |
Date |
2011 |
Export |
