Zobrazeno 1 - 10
of 332
pro vyhledávání: '"Zhang, Louxin"'
Autor:
Wu, Yufeng, Zhang, Louxin
Reconstructing a parsimonious phylogenetic network that displays multiple phylogenetic trees is an important problem in theory of phylogenetics, where the complexity of the inferred networks is measured by reticulation numbers. The reticulation numbe
Externí odkaz:
http://arxiv.org/abs/2408.14202
Good representations for phylogenetic trees and networks are important for optimizing storage efficiency and implementation of scalable methods for the inference and analysis of evolutionary trees for genes, genomes and species. We introduce a new re
Externí odkaz:
http://arxiv.org/abs/2405.07110
Autor:
Bulteau, Laurent, Zhang, Louxin
One strategy for reconstruction of phylogenetic networks is to solve the phylogenetic network problem, which involves inferring phylogenetic trees first and subsequently computing the smallest phylogenetic network that displays all the trees. This ap
Externí odkaz:
http://arxiv.org/abs/2307.04335
Understanding the mutational history of tumor cells is a critical endeavor in unraveling the mechanisms underlying cancer. Since the modeling of tumor cell evolution employs labeled trees, researchers are motivated to develop different methods to ass
Externí odkaz:
http://arxiv.org/abs/2301.05826
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 p
Externí odkaz:
http://arxiv.org/abs/2301.00992
Autor:
Wu, Yufeng, Zhang, Louxin
A binary phylogenetic network on a taxon set $X$ is a rooted acyclic digraph in which the degree of each nonleaf node is three and its leaves (i.e.degree-one nodes) are uniquely labeled with the taxa of $X$. It is tree-child if each nonleaf node has
Externí odkaz:
http://arxiv.org/abs/2207.02629
The Sackin and Colless indices are two widely-used metrics for measuring the balance of trees and for testing evolutionary models in phylogenetics. This short paper contributes two results about the Sackin and Colless indices of trees. One result is
Externí odkaz:
http://arxiv.org/abs/2201.10958
Autor:
Zhang, Louxin
A phylogenetic network is a simplex (or 1-component tree-child) network if the child of every reticulation node is a network leaf. Simplex networks are a superclass of phylogenetic trees and a subclass of tree-child networks. Generalizing the Sackin
Externí odkaz:
http://arxiv.org/abs/2112.15379
Autor:
Bulteau, Laurent, Zhang, Louxin
Publikováno v:
In Journal of Computer and System Sciences September 2024 144
We show a first-order asymptotics result for the number of galled networks with $n$ leaves. This is the first class of phylogenetic networks of {\it large} size for which an asymptotic counting result of such strength can be obtained. In addition, we
Externí odkaz:
http://arxiv.org/abs/2010.13324