title: Fast computation of minimum hybridization networks.
abstract: BACKGROUND
  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.
  
  
  METHODS
  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.
authors.affiliation: Department of Computer Science, Center for Bioinformatics (ZBIT), Tübingen University, Sand 14, 72076 Tübingen, Germany.
authors.forename: Benjamin
authors.initials: B
authors.lastname: Albrecht
authors.forename: Celine
authors.initials: C
authors.lastname: Scornavacca
authors.forename: Alberto
authors.initials: A
authors.lastname: Cenci
authors.forename: Daniel H
authors.initials: DH
authors.lastname: Huson
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D049810:Genetic Speciation; D006824:Hybridization, Genetic; D011003:Ploidies; D006109:Poaceae / Q000235:genetics*; D012984:Software; D014908:Triticum / Q000235:genetics*