English
Related papers

Related papers: `Lassoing' a phylogenetic tree I: Basic properties…

200 papers

'Tree-based' phylogenetic networks proposed by Francis and Steel have attracted much attention of theoretical biologists in the last few years. At the heart of the definitions of tree-based phylogenetic networks is the notion of 'support…

Combinatorics · Mathematics 2019-04-30 Momoko Hayamizu , Kazuhisa Makino

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)…

Populations and Evolution · Quantitative Biology 2023-12-01 Yufeng Wu , Louxin Zhang

We introduce a biologically natural, mathematically tractable model of random phylogenetic network to describe evolution in the presence of hybridization. One of the features of this model is that the hybridization rate of the lineages…

Probability · Mathematics 2024-02-27 François Bienvenu , Jean-Jil Duchamps

In this paper, we lay the groundwork on the comparison of phylogenetic networks based on edge contractions and expansions as edit operations, as originally proposed by Robinson and Foulds to compare trees. We prove that these operations…

Data Structures and Algorithms · Computer Science 2025-02-21 Bertrand Marchand , Nadia Tahiri , Olivier Tremblay-Savard , Manuel Lafond

Phylogenetics uses alignments of molecular sequence data to learn about evolutionary trees. Substitutions in sequences are modelled through a continuous-time Markov process, characterised by an instantaneous rate matrix, which standard…

Populations and Evolution · Quantitative Biology 2020-07-20 Naomi E. Hannaford , Sarah E. Heaps , Tom M. W. Nye , Tom A. Williams , T. Martin Embley

We apply the theory of markov random fields on trees to derive a phase transition in the number of samples needed in order to reconstruct phylogenies. We consider the Cavender-Farris-Neyman model of evolution on trees, where all the inner…

Probability · Mathematics 2007-05-23 Elchanan Mossel

When estimating a phylogeny from a multiple sequence alignment, researchers often assume the absence of recombination. However, if recombination is present, then tree estimation and all downstream analyses will be impacted, because…

An $n$-vertex tree $T$ is said to be $\textit{graceful}$ if there exists a bijective labelling $\phi:V(T)\to \{1,\ldots,n\}$ such that the edge-differences $\{|\phi(x)-\phi(y)| : xy\in E(T)\}$ are pairwise distinct. The longstanding…

Combinatorics · Mathematics 2025-11-17 Shoham Letzter , Alexey Pokrovskiy , Ella Williams

Phylogenetic trees and networks are graphs used to model evolutionary relationships, with trees representing strictly branching histories and networks allowing for events in which lineages merge, called reticulation events. While the…

Populations and Evolution · Quantitative Biology 2026-04-17 Martin Frohn , Niels Holtgrefe , Leo van Iersel , Mark Jones , Steven Kelk

Phylogenetic networks are generalizations of phylogenetic trees that allow the representation of reticulation events such as horizontal gene transfer or hybridization, and can also represent uncertainty in inference. A subclass of these,…

Populations and Evolution · Quantitative Biology 2019-10-15 Mareike Fischer , Andrew Francis

In evolutionary biology, networks are becoming increasingly used to represent evolutionary histories for species that have undergone non-treelike or reticulate evolution. Such networks are essentially directed acyclic graphs with a leaf set…

Populations and Evolution · Quantitative Biology 2023-08-23 Katharina T. Huber , Leo van Iersel , Vincent Moulton , Guillaume Scholz

Tree alignment graphs (TAGs) provide an intuitive data structure for storing phylogenetic trees that exhibits the relationships of the individual input trees and can potentially account for nested taxonomic relationships. This paper…

Data Structures and Algorithms · Computer Science 2015-03-16 Ruchi Chaudhary , David Fernandez-Baca , J. Gordon Burleigh

We provide time- and sample-efficient algorithms for learning and testing latent-tree Ising models, i.e. Ising models that may only be observed at their leaf nodes. On the learning side, we obtain efficient algorithms for learning a…

Machine Learning · Computer Science 2023-07-11 Davin Choo , Yuval Dagan , Constantinos Daskalakis , Anthimos Vardis Kandiros

Let ${\cal T}=(T,w)$ be a weighted finite tree with leaves $1,..., n$.For any $I :=\{i_1,..., i_k \} \subset \{1,...,n\}$, let $D_I ({\cal T})$ be the weight of the minimal subtree of $T$ connecting $i_1,..., i_k$; the $D_{I} ({\cal T})$…

Combinatorics · Mathematics 2016-01-12 Agnese Baldisserri , Elena Rubei

It was recently shown that a large class of phylogenetic networks, the `labellable' networks, is in bijection with the set of `expanding' covers of finite sets. In this paper, we show how several prominent classes of phylogenetic networks…

Populations and Evolution · Quantitative Biology 2024-04-11 Andrew Francis , Daniele Marchei , Mike Steel

A popular line of research in evolutionary biology is the use of time-calibrated phylogenies for the inference of diversification processes. This requires computing the likelihood of a given ultrametric tree as the reconstructed tree…

Populations and Evolution · Quantitative Biology 2013-01-24 Amaury Lambert , Hélène Morlon , Rampal S. Etienne

Evolutionary relationships between species are usually represented in phylogenies, i.e. evolutionary trees, which are a type of networks. The terminal nodes of these trees represent species, which are made of individuals and populations…

Populations and Evolution · Quantitative Biology 2007-07-11 E. Hernandez-Garcia , E. A. Herrada , A. F. Rozenfeld , C. J. Tessone , V. M. Eguiluz , C. M. Duarte , S. Arnaud-Haond , E. Serrao

Phylogenetic inference, grounded in molecular evolution models, is essential for understanding the evolutionary relationships in biological data. Accounting for the uncertainty of phylogenetic tree variables, which include tree topologies…

Machine Learning · Computer Science 2023-12-04 Takahiro Mimori , Michiaki Hamada

We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…

Data Structures and Algorithms · Computer Science 2020-11-03 Nomvelo Sibisi

Phylogenetic diversity indices are commonly used to rank the elements in a collection of species or populations for conservation purposes. The derivation of these indices is typically based on some quantitative description of the…

Populations and Evolution · Quantitative Biology 2024-03-26 Vincent Moulton , Andreas Spillner , Kristina Wicke
‹ Prev 1 8 9 10 Next ›