Algorithms in Bioinformatics


A   A   A
Sections
Home > Publications > Fast computation of minimum hybridization networks

Skip to content. | Skip to navigation

Document Actions

Benjamin Albrecht, Celine Scornavacca, Alberto Cenci, and Daniel H Huson (2011)

Fast computation of minimum hybridization networks

Bioinformatics.

Motivation: Hybridization events in evolution may lead to incongruent gene trees. One approach to determining possible interspecific hybridization events is to compute a hybridization network that attempts to reconcile incongruent gene trees using a minimum number of hybridization events.Results: We describe how to compute a representative set of minimum hybridization networks for two given bifurcating input trees, using a parallel algorithm and provide a user-friendly implementation. A simulation study suggests that our program performs significantly better than existing software on biologically relevant data. Finally, we demonstrate the application of such methods in the context of the evolution of the Aegilops/Triticum genera.Availability and Implementation: The algorithm is implemented in the program Dendroscope 3, which is freely available from www.dendroscope.org and runs on all three major operating systems.Contact: scornava@informatik.uni-tuebingen.de or huson@informatik.uni-tuebingen.de

10.1093/bioinformatics/btr618
« June 2019 »
June
MoTuWeThFrSaSu
12
3456789
10111213141516
17181920212223
24252627282930