title: A first step toward computing all hybridization networks for two rooted binary phylogenetic trees.
abstract: Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard app1235roach to tackle this problem being combinatorial, the reconstructed network is rarely unique. From a biological point of view, it is therefore of importance to not only compute one network, but all possible networks. In this article, we make a first step toward approaching this goal by presenting the first algorithm--called ALLMAAFs--that calculates all maximum-acyclic-agreement forests for two rooted binary phylogenetic trees on the same set of taxa.
authors.affiliation: Institut des Sciences de l'Evolution Université Montpellier II, Montpellier, France.
authors.forename: Celine
authors.initials: C
authors.lastname: Scornavacca
authors.forename: Simone
authors.initials: S
authors.lastname: Linz
authors.forename: Benjamin
authors.initials: B
authors.lastname: Albrecht
mesh_terms: D000465:Algorithms; D019295:Computational Biology; D003198:Computer Simulation; D008962:Models, Theoretical; D010802:Phylogeny