Orientation of Fitch graphs and reconciliation-free inference of horizontal gene transfer in gene trees

D Schaller, M Hellmuth, PF Stadler - SIAM Journal on Discrete Mathematics, 2023 - SIAM
Horizontal gene transfer (HGT) events partition a gene tree, and thus its leaf set, into subsets
of genes whose evolutionary history is described by speciation and duplication events …

Indirect identification of horizontal gene transfer

D Schaller, M Lafond, PF Stadler, N Wieseke… - Journal of mathematical …, 2021 - Springer
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 …

Complete characterization of incorrect orthology assignments in best match graphs

D Schaller, M Geiß, PF Stadler, M Hellmuth - Journal of mathematical …, 2021 - Springer
Genome-scale orthology assignments are usually based on reciprocal best matches. In the
absence of horizontal gene transfer (HGT), every pair of orthologs forms a reciprocal best …

The theory of gene family histories

M Hellmuth, PF Stadler - Comparative Genomics: Methods and Protocols, 2024 - Springer
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 …

AsymmeTree: A Flexible Python Package for the Simulation of Complex Gene Family Histories

D Schaller, M Hellmuth, PF Stadler - Software, 2022 - mdpi.com
AsymmeTree is a flexible and easy-to-use Python package for the simulation of gene family
histories. It simulates species trees and considers the joint action of gene duplication, loss …

[HTML][HTML] Complexity of modification problems for best match graphs

D Schaller, PF Stadler, M Hellmuth - Theoretical Computer Science, 2021 - Elsevier
Best match graphs (BMGs) are vertex-colored directed graphs that were introduced to model
the relationships of genes (vertices) from different species (colors) given an underlying …

Reconstruction of time-consistent species trees

M Lafond, M Hellmuth - Algorithms for Molecular Biology, 2020 - Springer
Background The history of gene families—which are equivalent to event-labeled gene trees—
can to some extent be reconstructed from empirically estimated evolutionary event-relations …

Best match graphs with binary trees

D Schaller, M Geiß, M Hellmuth, PF Stadler - International Conference on …, 2021 - Springer
Best match graphs (BMG) are a key intermediate in graph-based orthology detection and
contain a large amount of information on the gene tree. We provide a near-cubic algorithm to …

Heuristic algorithms for best match graph editing

D Schaller, M Geiß, M Hellmuth, PF Stadler - Algorithms for Molecular …, 2021 - Springer
Abstract Background Best match graphs (BMGs) are a class of colored digraphs that
naturally appear in mathematical phylogenetics as a representation of the pairwise most …

Relative timing information and orthology in evolutionary scenarios

D Schaller, T Hartmann, M Lafond, PF Stadler… - Algorithms for Molecular …, 2023 - Springer
Background 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 T to vertices and …