activity
20082026
most citedPhylogenomics with Paralogs

112 citations · 255 across the 57 of their papers we have counts for

collaborators
Showing q-bio.PEShow all

12 papers · 1 filter

q-bio.PE2026

Best Matches in Phylogenetic Networks

Patricia A. Ebert, Peter F. Stadler, Marc Hellmuth

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms…

q-bio.PE2023

The weighted total cophenetic index: A novel balance index for phylogenetic networks

Linda Knüver, Mareike Fischer, Marc Hellmuth +1

Phylogenetic networks play an important role in evolutionary biology as, other than phylogenetic trees, they can be used to accommodate reticulate evolutionary events such as horiz…

q-bio.PE2023

The Theory of Gene Family Histories

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

q-bio.PE2022

Relative Timing Information and Orthology in Evolutionary Scenarios

David Schaller, Tom Hartmann, Manuel Lafond +3

Evolutionary scenarios describing the evolution of a family of genes within a collection of species comprise the mapping of the vertices of a gene tree to vertices and edges of…

q-bio.PE2022

Clustering Systems of Phylogenetic Networks

Marc Hellmuth, David Schaller, Peter F. Stadler

Rooted acyclic graphs appear naturally when the phylogenetic relationship of a set of taxa involves not only speciations but also recombination, horizontal transfer, or hybridi…

q-bio.PE2021

Least resolved trees for two-colored best match graphs

David Schaller, Manuela Geiß, Marc Hellmuth +1

2-colored best match graphs (2-BMGs) form a subclass of sink-free bi-transitive graphs that appears in phylogenetic combinatorics. There, 2-BMGs describe evolutionarily most closel…