English
Related papers

Related papers: Non-hereditary maximum parsimony trees

200 papers

We introduce several axioms which may or may not hold for any given subgraph of the directed graph of all organisms (past, present and future) where edges represent biological parenthood, with the simplifying background assumption that life…

Populations and Evolution · Quantitative Biology 2026-02-06 Samuel Allen Alexander

Increasingly, biologists are constructing evolutionary trees on large numbers of overlapping sets of taxa, and then combining them into a `supertree' that classifies all the taxa. In this paper, we ask how much coverage of the total set of…

Populations and Evolution · Quantitative Biology 2009-06-29 Mike Steel , Michael J. Sanderson

We present a new algorithm for finding maximum a-posterior) (MAP) assignments of values to belief networks. The belief network is compiled into a network consisting only of nodes with boolean (i.e. only 0 or 1) conditional probabilities.…

Artificial Intelligence · Computer Science 2013-04-05 Solomon Eyal Shimony , Eugene Charniak

In this paper we explore the concept of {\em good heredity} for fields from a group theoretic perspective. Extending results from \cite{alice}, we show that several natural families of fields are of good heredity, and some others are not.…

Rings and Algebras · Mathematics 2016-01-15 Alice Medvedev , Ramin Takloo-Bighash

The reconstruction of a species tree from genomic data faces a double hurdle. First, the (gene) tree describing the evolution of each gene may differ from the species tree, for instance, due to incomplete lineage sorting. Second, the…

Populations and Evolution · Quantitative Biology 2021-12-07 Sebastien Roch , Mike Steel

In a recent study, Bryant, Francis and Steel investigated the concept of \enquote{future-proofing} consensus methods in phylogenetics. That is, they investigated if such methods can be robust against the introduction of additional data like…

Populations and Evolution · Quantitative Biology 2025-01-31 Mareike Fischer , Michael Hendriksen

The Maximum Agreement Forest problem has been extensively studied in phylogenetics. Most previous work is on two binary phylogenetic trees. In this paper, we study a generalized version of the problem: the Maximum Agreement Forest problem…

Data Structures and Algorithms · Computer Science 2016-09-06 Feng Shi , Jianer Chen , Qilong Feng , Jianxin Wang

Phylogenetic comparative methods correct for shared evolutionary history among a set of non-independent organisms by modeling sample traits as arising from a diffusion process along on the branches of a possibly unknown history. To…

Applications · Statistics 2020-09-30 Paul Bastide , Lam Si Tung Ho , Guy Baele , Philippe Lemey , Marc A Suchard

We study the ChorHendySnir2006 evolutionary model, which consists of a rooted phylogenetic tree with three leaves, subject to the Jukes--Cantor (JC69) molecular evolutionary model and molecular clock. We show that the likelihood function…

Populations and Evolution · Quantitative Biology 2026-01-23 Maria Emilíia Alonso , Ernesto Álvarez

Phylogenetic mixture models, in which the sites in sequences undergo different substitution processes along the same or different trees, allow the description of heterogeneous evolutionary processes. As data sets consisting of longer…

Populations and Evolution · Quantitative Biology 2012-07-17 Elizabeth S. Allman , John A. Rhodes , Seth Sullivant

Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have been proposed in the literature, the subclass of binary…

Data Structures and Algorithms · Computer Science 2020-07-01 Gabriel Cardona , Joan Carles Pons , Celine Scornavacca

The Maximum Agreement Forest (Maf) problem is a well-studied problem in evolutionary biology, which asks for a largest common subforest of a given collection of phylogenetic trees with identical leaf label-set. However, the previous work…

Data Structures and Algorithms · Computer Science 2014-11-04 Feng Shi , Jianer Chen , Qilong Feng , Xiaojun Ding , Jianxin Wang

Reconstructing the evolutionary history relating a collection of molecular sequences is the main subject of modern Bayesian phylogenetic inference. However, the commonly used Markov chain Monte Carlo methods can be inefficient due to the…

Machine Learning · Statistics 2024-08-12 Tianyu Xie , Frederick A. Matsen , Marc A. Suchard , Cheng Zhang

Consider a set of labels $L$ and a set of trees ${\mathcal T} = \{{\mathcal T}^{(1), {\mathcal T}^{(2), ..., {\mathcal T}^{(k) \$ where each tree ${\mathcal T}^{(i)$ is distinctly leaf-labeled by some subset of $L$. One fundamental problem…

Data Structures and Algorithms · Computer Science 2008-02-21 Viet Tung Hoang , Wing-Kin Sung

Given two rooted phylogenetic trees on the same set of taxa X, the Maximum Agreement Forest problem (MAF) asks to find a forest that is, in a certain sense, common to both trees and has a minimum number of components. The Maximum Acyclic…

Combinatorics · Mathematics 2012-12-27 Leo van Iersel , Steven Kelk , Nela Lekić , Leen Stougie

Most genes are part of larger families of evolutionary related genes. The history of gene families typically involves duplications and losses of genes as well as horizontal transfers into other organisms. The reconstruction of detailed gene…

Populations and Evolution · Quantitative Biology 2023-04-25 Marc Hellmuth , Peter F. Stadler

We consider sequences of finite weighted random graphs that converge locally to unimodular i.i.d. weighted random trees. When the weights are atomless, we prove that the matchings of maximal weight converge locally to a matching on the…

Probability · Mathematics 2025-03-31 Nathanaël Enriquez , Mike Liu , Laurent Ménard , Vianney Perchet

Sequence comparison across multiple organisms aids in the detection of regions under selection. However, resource limitations require a prioritization of genomes to be sequenced. This prioritization should be grounded in two considerations:…

Genomics · Quantitative Biology 2007-05-23 Jon D. McAuliffe , Michael I. Jordan , Lior Pachter

In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species $X$; these relationships are often depicted via a phylogenetic tree -- a tree having its leaves univocally labeled by elements of $X$…

Data Structures and Algorithms · Computer Science 2016-04-12 Julien Baste , Christophe Paul , Ignasi Sau , Celine Scornavacca

We consider the problem of constructing an an optimal-weight tree from the 3*(n choose 4) weighted quartet topologies on n objects, where optimality means that the summed weight of the embedded quartet topologiesis optimal (so it can be the…

Data Structures and Algorithms · Computer Science 2011-11-09 Rudi Cilibrasi , Paul M. B. Vitanyi