Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02155241
Contributor : Celine Scornavacca <>
Submitted on : Wednesday, December 18, 2019 - 4:11:32 PM
Last modification on : Friday, September 18, 2020 - 2:34:42 PM
Long-term archiving on: : Thursday, March 19, 2020 - 10:15:27 PM

File

Scornavacca_10.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Thu-Hien To, Celine Scornavacca. Efficient algorithms for reconciling gene trees and species networks via duplication and loss events. BMC Genomics, BioMed Central, 2015, 16 (S10), pp.4 - 7. ⟨10.1186/1471-2164-16-S10-S6⟩. ⟨hal-02155241⟩

Share

Metrics

Record views

230

Files downloads

383