Who is Who in Phylogenetic Networks

Publication no #2140   Type :   Html | Bib | Both

Created: 2011-09-21 23:52:55     Modified: 2014-08-19 20:13:24

2140 Celine Scornavacca, Simone Linz and Benjamin Albrecht. A first step towards computing all hybridization networks for two rooted binary phylogenetic trees. In JCB, Vol. 19:1227-1242, 2012. Keywords: agreement forest, explicit network, FPT, from rooted trees, phylogenetic network, phylogeny, Program Dendroscope, Program Hybroscale, reconstruction. Note: http://arxiv.org/abs/1109.3268.         Toggle abstract "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. © Copyright 2012, Mary Ann Liebert, Inc. 2012." @Article{SLA2012,       AUTHOR = {Scornavacca, Celine and Linz, Simone and Albrecht, Benjamin},       TITLE = {A first step towards computing all hybridization networks for two rooted binary phylogenetic trees},       YEAR = {2012},       JOURNAL = {JCB},       VOLUME = {19},       PAGES = {1227-1242},       URL = {http://dx.doi.org/10.1089/cmb.2012.0192},       NOTE = {http://arxiv.org/abs/1109.3268},       KEYWORDS = {agreement forest, explicit network, FPT, from rooted trees, phylogenetic network, phylogeny, Program Dendroscope, Program Hybroscale, reconstruction} }