A fast and scalable method for inferring phylogenetic networks from trees by aligning lineage taxon strings.

ABSTRACT: The reconstruction of phylogenetic networks is an important but challenging problem in phylogenetics and genome evolution, as the space of phylogenetic networks is vast and cannot be sampled well. One approach to the problem is to solve the minimum phylogenetic network problem, in which phylogenetic trees are first inferred, and then the smallest phylogenetic network that displays all the trees is computed. The approach takes advantage of the fact that the theory of phylogenetic trees is mature, and there are excellent tools available for inferring phylogenetic trees from a large number of biomolecular sequences. A tree-child network is a phylogenetic network satisfying the condition that every nonleaf node has at least one child that is of indegree one. Here, we develop a new method that

SUBMITTER: Zhang L 

PROVIDER: S-EPMC10538497 | biostudies-literature | 2023 Jul

REPOSITORIES: biostudies-literature