Literature DB >> 23294271

An ultrafast tool for minimum reticulate networks.

Zhi-Zhong Chen1, Lusheng Wang.   

Abstract

Due to hybridization events in evolution, studying different genes of a set of species may yield two or more related but different phylogenetic trees for the set of species. In this case, we want to combine the trees into a reticulate network with the fewest hybridization events. In this article, we develop a software tool (named UltraNet) for several fundamental problems related to the construction of minimum reticulate networks from two or more phylogenetic trees. Our experimental results show that UltraNet is much faster than all previous tools for these problems.

Mesh:

Year:  2013        PMID: 23294271     DOI: 10.1089/cmb.2012.0240

Source DB:  PubMed          Journal:  J Comput Biol        ISSN: 1066-5277            Impact factor:   1.479


  3 in total

1.  An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees.

Authors:  Yufeng Wu
Journal:  J Comput Biol       Date:  2013-10       Impact factor: 1.479

2.  Supertrees Based on the Subtree Prune-and-Regraft Distance.

Authors:  Christopher Whidden; Norbert Zeh; Robert G Beiko
Journal:  Syst Biol       Date:  2014-04-02       Impact factor: 15.683

3.  A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.

Authors:  Leo van Iersel; Steven Kelk; Nela Lekić; Celine Scornavacca
Journal:  BMC Bioinformatics       Date:  2014-05-05       Impact factor: 3.169

  3 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.