title: Efficient algorithms for reconciling gene trees and species networks via duplication and loss events.
abstract: Reconciliation methods explain topology differences between a species tree and a gene tree by evolutionary events other than speciations. However, not all phylogenies are trees: hybridization can occur and create new species and this results into reticulate phylogenies. Here, we consider the problem of reconciling a gene tree with a species network via duplication and loss events. Two variants are proposed and solved with effcient algorithms: the first one finds the best tree in the network with which to reconcile the gene tree, and the second one finds the best reconciliation between the gene tree and the whole network.
authors.forename: Thu-Hien
authors.initials: TH
authors.lastname: To
authors.forename: Celine
authors.initials: C
authors.lastname: Scornavacca
mesh_terms: D000465:Algorithms; D019143:Evolution, Molecular; D020440:Gene Duplication / Q000235:genetics*; D049810:Genetic Speciation; D023281:Genomics; D010802:Phylogeny