Who is Who in Phylogenetic Networks

Publication no #2416   Type :   Html | Bib | Both

Created: 2014-09-09 12:31:07     Modified: 2014-09-24 08:33:13

2416 Juan Wang. A new algorithm to construct phylogenetic networks from trees. In Genetics and Molecular Research, Vol. 13(1):1456-1464, 2014. Keywords: explicit network, from clusters, heuristic, phylogenetic network, Program LNetwork, Program QuickCass, reconstruction. Note: http://dx.doi.org/10.4238/2014.March.6.4.         Toggle abstract "Developing appropriate methods for constructing phylogenetic networks from tree sets is an important problem, and much research is currently being undertaken in this area. BIMLR is an algorithm that constructs phylogenetic networks from tree sets. The algorithm can construct a much simpler network than other available methods. Here, we introduce an improved version of the BIMLR algorithm, QuickCass. QuickCass changes the selection strategy of the labels of leaves below the reticulate nodes, i.e., the nodes with an indegree of at least 2 in BIMLR. We show that QuickCass can construct simpler phylogenetic networks than BIMLR. Furthermore, we show that QuickCass is a polynomial-time algorithm when the output network that is constructed by QuickCass is binary. © FUNPEC-RP." @Article{Wang2014,       AUTHOR = {Wang, Juan},       TITLE = {A new algorithm to construct phylogenetic networks from trees},       YEAR = {2014},       JOURNAL = {Genetics and Molecular Research},       VOLUME = {13},       NUMBER = {1},       PAGES = {1456-1464},       URL = {http://dx.doi.org/10.4238/2014.March.6.4},       NOTE = {http://dx.doi.org/10.4238/2014.March.6.4},       KEYWORDS = {explicit network, from clusters, heuristic, phylogenetic network, Program LNetwork, Program QuickCass, reconstruction} }