English
Related papers

Related papers: Relative Timing Information and Orthology in Evolu…

200 papers

Several implicit methods to infer Horizontal Gene Transfer (HGT) focus on pairs of genes that have diverged only after the divergence of the two species in which the genes reside. This situation defines the edge set of a graph, the…

Populations and Evolution · Quantitative Biology 2021-04-07 David Schaller , Manuel Lafond , Peter F. Stadler , Nicolas Wieseke , Marc Hellmuth

Horizontal gene transfer is an important contributor to evolution. According to Walter M.\ Fitch, two genes are xenologs if they are separated by at least one HGT. More formally, the directed Fitch graph has a set of genes is its vertices,…

Data Structures and Algorithms · Computer Science 2023-06-13 Marc Hellmuth , Peter F. Stadler , Sandhya Thekkumpadan Puthiyaveedu

Horizontal gene transfer events partition a gene tree $T$ and thus, its leaf set into subsets of genes whose evolutionary history is described by speciation and duplication events alone. Indirect phylogenetic methods can be used to infer…

Discrete Mathematics · Computer Science 2021-12-02 David Schaller , Marc Hellmuth , Peter F. Stadler

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

Given a set of species whose evolution is represented by a species tree, a gene family is a group of genes having evolved from a single ancestral gene. A gene family evolves along the branches of a species tree through various mechanisms,…

Combinatorics · Mathematics 2019-05-14 Cedric Chauve , Yann Ponty , Michael Wallner

In the absence of horizontal gene transfer it is possible to reconstruct the history of gene families from empirically determined orthology relations, which are equivalent to event-labeled gene trees. Knowledge of the event labels…

Discrete Mathematics · Computer Science 2017-05-08 Nikolai Nøjgaard , Manuela Geiß , Peter F. Stadler , Daniel Merkle , Nicolas Wieseke , Marc Hellmuth

Orthology and paralogy relations are often inferred by methods based on gene similarity, which usually yield a graph depicting the relationships between gene pairs. Such relation graphs are known to frequently contain errors, as they cannot…

Data Structures and Algorithms · Computer Science 2022-02-16 Mark Jones , 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…

Populations and Evolution · Quantitative Biology 2025-02-14 Anna Lindeberg , Guillaume E. Scholz , Nicolas Wieseke , Marc Hellmuth

Phylogenetic trees are simple models of evolutionary processes. They describe conditionally independent divergent evolution of taxa from common ancestors. Phylogenetic trees commonly do not have enough flexibility to adequately model all…

Populations and Evolution · Quantitative Biology 2025-11-11 Jonathan D. Mitchell , Barbara R. Holland

In mathematical phylogenetics, evolutionary relationships are often represented by trees and networks. The latter are typically used whenever the relationships cannot be adequately described by a tree, which happens when so-called…

Populations and Evolution · Quantitative Biology 2025-12-05 Mirko Wilde , Mareike Fischer

A wide variety of problems in computational biology, most notably the assessment of orthology, are solved with the help of reciprocal best matches. Using an evolutionary definition of best matches that captures the intuition behind the…

Pairwise compatibility graphs (PCGs) with non-negative integer edge weights recently have been used to describe rare evolutionary events and scenarios with horizontal gene transfer. Here we consider the case that vertices are separated by…

Combinatorics · Mathematics 2020-05-26 Yangjing Long , Peter F. Stadler

Fitch graphs $G=(X,E)$ are digraphs that are explained by $\{\emptyset, 1\}$-edge-labeled rooted trees $T$ with leaf set $X$: there is an arc $(x,y) \in E$ if and only if the unique path in $T$ that connects the last common ancestor…

Discrete Mathematics · Computer Science 2021-10-19 Marc Hellmuth , Carsten R. Seemann , Peter F. Stadler

Gene gains and losses have shaped the gene repertoire of species since the universal last common ancestor to species today. Genes in extant species were gained at different historical times via de novo creation of new genes, duplication of…

Populations and Evolution · Quantitative Biology 2018-02-19 Haiming Tang , Paul Thomas , Haoran Xia

Evolutionary graph theory (EGT) studies the effect of population structure on evolutionary dynamics. The vertices of the graph represent the $N$ individuals. The edges denote interactions for competitive replacement. Two standard update…

Populations and Evolution · Quantitative Biology 2026-04-01 David A. Brewster , Yichen Huang , Michael Mitzenmacher , Martin A. Nowak

THIS IS A CORRECTED VERSION INCLUDING AN APPENDED CORRIGENDUM. Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let $T$ be a phylogenetic (gene) tree $T$ and $\sigma$ an…

Lateral gene transfer (LGT) is a common mechanism of non-vertical evolution where genetic material is transferred between two more or less distantly related organisms. It is particularly common in bacteria where it contributes to adaptive…

Probability · Mathematics 2012-06-18 Sebastien Roch , Sagi Snir

In phylogenetic studies, the evolution of molecular sequences is assumed to have taken place along the phylogeny traced by the ancestors of extant species. In the presence of lateral gene transfer (LGT), however, this may not be the case,…

Populations and Evolution · Quantitative Biology 2013-07-01 Gergely J Szöllösi , Eric Tannier , Nicolas Lartillot , Vincent Daubin

Phylogenomics heavily relies on well-curated sequence data sets that consist, for each gene, exclusively of 1:1-orthologous. Paralogs are treated as a dangerous nuisance that has to be detected and removed. We show here that this severe…

Discrete Mathematics · Computer Science 2017-12-19 Marc Hellmuth , Nicolas Wieseke , Marcus Lechner , Hans-Peter Lenhof , Martin Middendorf , Peter F. Stadler

The history of gene families - which are equivalent to \emph{event-labeled} gene trees - can be reconstructed from empirically estimated evolutionary event-relations containing pairs of orthologous, paralogous or xenologous genes. The…

Discrete Mathematics · Computer Science 2017-06-13 Marc Hellmuth
‹ Prev 1 2 3 10 Next ›