Netcombin: An algorithm for constructing optimal phylogenetic network from rooted triplets.

ABSTRACT: Phylogenetic networks construction is one the most important challenge in phylogenetics. These networks can present complex non-treelike events such as gene flow, horizontal gene transfers, recombination or hybridizations. Among phylogenetic networks, rooted structures are commonly used to represent the evolutionary history of a species set, explicitly. Triplets are well known input for constructing the rooted networks. Obtaining an optimal rooted network that contains all given triplets is main problem in network construction. The optimality criteria include minimizing the level or the number of reticulation nodes. The complexity of this problem is known to be NP-hard. In this research, a new algorithm called Netcombin is introduced to construct approximately an optimal network which is c

SUBMITTER: Poormohammadi H 

PROVIDER: S-EPMC7500971 | biostudies-literature | 2020

REPOSITORIES: biostudies-literature