FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization.

ABSTRACT:

Motivation

The estimation of phylogenetic trees is a major part of many biological dataset analyses, but maximum likelihood approaches are NP-hard and Bayesian MCMC methods do not scale well to even moderate-sized datasets. Supertree methods, which are used to construct trees from trees computed on subsets, are critically important tools for enabling the statistical estimation of phylogenies for large and potentially heterogeneous datasets. Supertree estimation is itself NP-hard, and no current supertree method has sufficient accuracy and scalability to provide good accuracy on the large datasets that supertree methods were designed for, containing thousands of species and many subset trees.

Results

We present FastRFS, a new method based on a dynamic programming method we ha

SUBMITTER: Vachaspati P 

PROVIDER: S-EPMC5870905 | biostudies-literature | 2017 Mar

REPOSITORIES: biostudies-literature