title: Refining discordant gene trees.
abstract: BACKGROUND
  Evolutionary studies are complicated by discordance between gene trees and the species tree in which they evolved. Dealing with discordant trees often relies on comparison costs between gene and species trees, including the well-established Robinson-Foulds, gene duplication, and deep coalescence costs. While these costs have provided credible results for binary rooted gene trees, corresponding cost definitions for non-binary unrooted gene trees, which are frequently occurring in practice, are challenged by biological realism.
  
  
  RESULTS
  We propose a natural extension of the well-established costs for comparing unrooted and non-binary gene trees with rooted binary species trees using a binary refinement model. For the duplication cost we describe an efficient algorithm that is based on a linear time reduction and also computes an optimal rooted binary refinement of the given gene tree. Finally, we show that similar reductions lead to solutions for computing the deep coalescence and the Robinson-Foulds costs.
  
  
  CONCLUSIONS
  Our binary refinement of Robinson-Foulds, gene duplication, and deep coalescence costs for unrooted and non-binary gene trees together with the linear time reductions provided here for computing these costs significantly extends the range of trees that can be incorporated into approaches dealing with discordance.
authors.forename: Pawel
authors.initials: P
authors.lastname: Górecki
authors.forename: Oliver
authors.initials: O
authors.lastname: Eulenstein
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D020440:Gene Duplication; D008957:Models, Genetic; D010802:Phylogeny