Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters.
Phylogenetic trees are widely used to display estimates of how groups of species are evolved. Each phylogenetic tree can be seen as a collection of clusters, subgroups of the species that evolved from a common ancestor. When phylogenetic trees are obtained for several datasets (e.g. for different genes), then their clusters are often contradicting. Consequently, the set of all clusters of such a dataset cannot be combined into a single phylogenetic tree. Phylogenetic networks are a generalization of phylogenetic trees that can be used to display more complex evolutionary histories, including reticulate events, such as hybridizations, recombinations and horizontal gene transfers. Here, we present the new Cass algorithm that can combine any set of clusters into a phylogenetic network. We show that the networks constructed by Cass are usually simpler than networks constructed by other available methods. Moreover, we show that Cass is guaranteed to produce a network with at most two reticulations per biconnected component, whenever such a network exists. We have implemented Cass and integrated it into the freely available Dendroscope software.


BACKGROUND
Supplementary data are available at Bioinformatics online.
Department of Mathematics and Statistics, University of Canterbury, Private Bag 4800, Christchurch, New Zealand. l.j.j.v.iersel@gmail.com
Leo
L
van Iersel
Steven
S
Kelk
Regula
R
Rupp
Daniel
D
Huson
D000465:Algorithms; D016000:Cluster Analysis; D019143:Evolution, Molecular; D010802:Phylogeny