Skip to Main content Skip to Navigation
Journal articles

Fast computation of minimum hybridization networks

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

Cited literature [43 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02155006
Contributor : Celine Scornavacca Connect in order to contact the contributor
Submitted on : Monday, December 16, 2019 - 4:59:47 PM
Last modification on : Friday, October 22, 2021 - 2:58:33 PM
Long-term archiving on: : Tuesday, March 17, 2020 - 8:08:04 PM

File

Scornavacca_26.pdf
Files produced by the author(s)

Identifiers

Collections

`

Citation

Benjamin Albrecht, Celine Scornavacca, Alberto Cenci, Daniel Huson. Fast computation of minimum hybridization networks. Bioinformatics, Oxford University Press (OUP), 2012, 28 (2), pp.191-197. ⟨10.1093/bioinformatics/btr618⟩. ⟨hal-02155006⟩

Share

Metrics

Record views

178

Files downloads

285