### Abstract

Rooted phylogenetic networks are used to model non-treelike evolutionary histories. Such networks are often constructed by combining trees, clusters, triplets or characters into a single network that in some well-defined sense simultaneously represents them all. We review these four models and investigate how they are related. Motivated by the parsimony principle, one often aims to construct a network that contains as few reticulations (non-treelike evolutionary events) as possible. In general, the model chosen influences the minimum number of reticulation events required. However, when one obtains the input data from two binary (i.e. fully resolved) trees, we show that the minimum number of reticulations is independent of the model. The number of reticulations necessary to represent the trees, triplets, clusters (in the softwired sense) and characters (with unrestricted multiple crossover recombination) are all equal. Furthermore, we show that these results also hold when not the number of reticulations but the level of the constructed network is minimised. We use these unification results to settle several computational complexity questions that have been open in the field for some time. We also give explicit examples to show that already for data obtained from three binary trees the models begin to diverge.

Original language | English |
---|---|

Pages (from-to) | 245-255 |

Number of pages | 11 |

Journal | Journal of Theoretical Biology |

Volume | 269 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2011 |

## Cite this

van Iersel, L., & Kelk, S. (2011). When two trees go to war.

*Journal of Theoretical Biology*,*269*(1), 245-255. https://doi.org/10.1016/j.jtbi.2010.10.032