A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computational Biology Année : 2012

A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees

Résumé

Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard app1235roach to tackle this problem being combinatorial, the reconstructed network is rarely unique. From a biological point of view, it is therefore of importance to not only compute one network, but all possible networks. In this article, we make a first step toward approaching this goal by presenting the first algorithm--called ALLMAAFs--that calculates all maximum-acyclic-agreement forests for two rooted binary phylogenetic trees on the same set of taxa.
Fichier principal
Vignette du fichier
Scornavacca_16.pdf (602.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02154992 , version 1 (18-12-2019)

Identifiants

Citer

Celine Scornavacca, Simone Linz, Benjamin Albrecht. A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees. Journal of Computational Biology, 2012, 19 (11), pp.1227-1242. ⟨10.1089/cmb.2012.0192⟩. ⟨hal-02154992⟩
201 Consultations
68 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More