Search Results for author: Louxin Zhang

Found 9 papers, 2 papers with code

A Vector Representation for Phylogenetic Trees

1 code implementation11 May 2024 Cedric Chauve, Caroline Colijn, Louxin Zhang

The HOP distance can be computed in near-linear time, a rare instance of a tree rearrangement distance that is tractable.

Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees

no code implementations30 Nov 2023 Yufeng Wu, Louxin Zhang

Phylogenetic network is an evolutionary model that uses a rooted directed acyclic graph (instead of a tree) to model an evolutionary history of species in which reticulate events (e. g., hybrid speciation or horizontal gene transfer) occurred.

The k-Robinson-Foulds Dissimilarity Measures for Comparison of Labeled Trees

no code implementations14 Jan 2023 Elahe Khayatian, Gabriel Valiente, Louxin Zhang

Like the Robinson-Foulds distance, the k-Robinson-Foulds is a pseudometric for multiset-labeled trees and becomes a metric in the space of 1-labeled trees.

A Fast and Scalable Method for Inferring Phylogenetic Networks from Trees by Aligning Lineage Taxon Strings

no code implementations3 Jan 2023 Louxin Zhang, Niloufar Abhari, Caroline Colijn, Yufeng Wu

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.

Can Multiple Phylogenetic Trees Be Displayed in a Tree-Child Network Simultaneously?

no code implementations6 Jul 2022 Yufeng Wu, Louxin Zhang

It is also proved that any set of multiple binary phylogenetic trees can always simultaneously be displayed in some non-binary tree-child network on the same taxa set, where each nonleaf node is of either indegree one and outdegree two or indegree at least two and outdegree out.

Two Results about the Sackin and Colless Indices for Phylogenetic Trees and Their Shapes

no code implementations26 Jan 2022 Gary Goh, Michael Fuchs, Louxin Zhang

Another is a short elementary proof of the closed formula for the expected Sackin index of phylogenetic trees (which are full binary rooted trees with leaves being labelled with taxa) under the uniform model.

The Sackin Index of Simplex Networks

no code implementations31 Dec 2021 Louxin Zhang

A phylogenetic network is a simplex (or 1-component tree-child) network if the child of every reticulation node is a network leaf.

Counting and Enumerating Galled Networks

no code implementations20 Dec 2018 Andreas DM Gunawan, Jeyaram Rathin, Louxin Zhang

Galled trees are widely studied as a recombination model in population genetics.

Populations and Evolution

On Tree Based Phylogenetic Networks

1 code implementation5 Sep 2015 Louxin Zhang

Reticulation-visible networks and child-sibling networks are all tree based.

Cannot find the paper you are looking for? You can Submit a new open access paper.