Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees.

ABSTRACT:

Motivation

Reticulate network is a model for displaying and quantifying the effects of complex reticulate processes on the evolutionary history of species undergoing reticulate evolution. A central computational problem on reticulate networks is: given a set of phylogenetic trees (each for some region of the genomes), reconstruct the most parsimonious reticulate network (called the minimum reticulate network) that combines the topological information contained in the given trees. This problem is well-known to be NP-hard. Thus, existing approaches for this problem either work with only two input trees or make simplifying topological assumptions.

Results

We present novel results on the minimum reticulate network problem. Unlike existing approaches, we address the fully general

SUBMITTER: Wu Y 

PROVIDER: S-EPMC2881383 | biostudies-literature | 2010 Jun

REPOSITORIES: biostudies-literature