中文
相关论文

相关论文: A Fast and Scalable Method for Inferring Phylogene…

200 篇论文

Unrooted phylogenetic networks are graphs used to represent evolutionary relationships. Accurately reconstructing such networks is of great relevance for evolutionary biology. It has recently been conjectured that all phylogenetic networks…

组合数学 · 数学 2021-01-01 Péter L. Erdős , Leo van Iersel , Mark Jones

Tree-child networks are an important network class which are used in phylogenetics to model reticulate evolution. In a recent paper, Pons and Batle (2021) conjectured a relation between tree-child networks and certain words. In this short…

种群与进化 · 定量生物学 2021-10-11 Michael Fuchs , Hexuan Liu , Guan-Ru Yu

The structure of an evolving network contains information about its past. Extracting this information efficiently, however, is, in general, a difficult challenge. We formulate a fast and efficient method to estimate the most likely history…

物理与社会 · 物理学 2020-09-16 Gábor Timár , Rui A. da Costa , Sergey N. Dorogovtsev , José F. F. Mendes

A phylogenetic network is a graph-theoretical tool that is used by biologists to represent the evolutionary history of a collection of species. One potential way of constructing such networks is via a distance-based approach, where one is…

组合数学 · 数学 2020-06-15 Leo van Iersel , Vincent Moulton , Yukihiro Murakami

Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard…

种群与进化 · 定量生物学 2011-09-16 Celine Scornavacca , Simone Linz , Benjamin Albrecht

In the study of rooted phylogenetic networks, analyzing the set of rooted phylogenetic trees that are embedded in such a network is a recurring task. From an algorithmic viewpoint, this analysis almost always requires an exhaustive search…

组合数学 · 数学 2023-08-21 Simone Linz , Charles Semple

We propose a statistical method to test whether two phylogenetic trees with given alignments are significantly incongruent. Our method compares the two distributions of phylogenetic trees given by the input alignments, instead of comparing…

种群与进化 · 定量生物学 2010-04-14 Elissaveta Arnaoudova , David Haws , Peter Huggins , Jerzy W. Jaromczyk , Neil Moore , Chris Schardl , Ruriko Yoshida

It is a known fact that, given two rooted binary phylogenetic trees, the concept of maximum acyclic agreement forests is sufficient to compute hybridization networks with minimum hybridization number. In this work, we demonstrate by first…

种群与进化 · 定量生物学 2015-12-18 Benjamin Albrecht

Normal networks are an important class of phylogenetic networks that have compelling mathematical properties which align with intuition about inference from genetic data. While tools enabling widespread use of phylogenetic networks in the…

组合数学 · 数学 2025-12-16 Andrew Francis , Charles Semple

We introduce a simple algorithm for reconstructing phylogenies from multiple gene trees in the presence of incomplete lineage sorting, that is, when the topology of the gene trees may differ from that of the species tree. We show that our…

种群与进化 · 定量生物学 2011-09-30 Elchanan Mossel , Sebastien Roch

The Persistent-Phylogeny Model is an extension of the widely studied Perfect-Phylogeny Model, encompassing a broader range of evolutionary phenomena. Biological and algorithmic questions concerning persistent phylogeny have been intensely…

种群与进化 · 定量生物学 2015-06-03 Dan Gusfield

Networks are ubiquitous in biology and computational approaches have been largely investigated for their inference. In particular, supervised machine learning methods can be used to complete a partially known network by integrating various…

机器学习 · 计算机科学 2014-04-25 Marie Schrynemackers , Louis Wehenkel , M. Madan Babu , Pierre Geurts

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

组合数学 · 数学 2019-04-30 Momoko Hayamizu , Kazuhisa Makino

Reconciling gene trees with a species tree is a fundamental problem to understand the evolution of gene families. Many existing approaches reconcile each gene tree independently. However, it is well-known that the evolution of gene families…

种群与进化 · 定量生物学 2018-06-12 Riccardo Dondi , Manuel Lafond , Celine Scornavacca

Orthologous genes, which arise through speciation, play a key role in comparative genomics and functional inference. In particular, graph-based methods allow for the inference of orthology estimates without prior knowledge of the underlying…

种群与进化 · 定量生物学 2025-02-14 Anna Lindeberg , Guillaume E. Scholz , Nicolas Wieseke , Marc Hellmuth

A normal network is uniquely determined by the set of phylogenetic trees that it displays. Given a set $\mathcal{P}$ of rooted binary phylogenetic trees, this paper presents a polynomial-time algorithm that reconstructs the unique binary…

组合数学 · 数学 2024-07-10 Magnus Bordewich , Simone Linz , Charles Semple

Phylogenetic networks are used to represent the evolutionary history of species. Recently, the new class of orchard networks was introduced, which were later shown to be interpretable as trees with additional horizontal arcs. This makes the…

组合数学 · 数学 2023-05-09 Leo van Iersel , Mark Jones , Esther Julien , Yukihiro Murakami

Least squares estimation of phylogenies is an established family of methods with good statistical properties. State-of-the-art least squares phylogenetic estimation proceeds by first estimating a distance matrix, which is then used to…

种群与进化 · 定量生物学 2024-06-24 Peter B. Chi , Volodymyr M. Minin

The presence of reticulate evolutionary events in phylogenies turn phylogenetic trees into phylogenetic networks. These events imply in particular that there may exist multiple evolutionary paths from a non-extant species to an extant one,…

种群与进化 · 定量生物学 2008-03-21 Gabriel Cardona , Merce Llabres , Francesc Rossello , Gabriel Valiente

We present an efficient phylogenetic reconstruction algorithm allowing insertions and deletions which provably achieves a sequence-length requirement (or sample complexity) growing polynomially in the number of taxa. Our algorithm is…

概率论 · 数学 2013-02-25 Constantinos Daskalakis , Sebastien Roch