David Schaller

Mr. David Schaller

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 August 2023 in Theory in Biosciences
Verified
Journal Article
Open access
PDF file
MHMarc Hellmuth
Marc Hellmuth
DSDavid Schaller
David Schaller
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
Rooted acyclic graphs appear naturally when the phylogenetic relationship of a set X of taxa involves not only speciations but also recombination, horizontal transfer, or hybridization that cannot be captured by trees. A variety of classes of such networks have been discussed in the literature, including phylogenetic, level-1, tree-child, tree-based, galled tree, regular, or normal networks as models of different types of evolutionary processes. Clusters arise in models of phylogeny as the sets $${{\,\mathrm{\texttt{C}}\,}}(v)$$ C ( v ) of descendant taxa of a vertex v. The clustering system $$\mathscr {C}_N$$ C N comprising the clusters of a network N conveys key information on N itself. In the special case of rooted phylogenetic trees, T is uniquely determined by its clustering system $$\mathscr {C}_T$$ C T . Although this is no longer true for networks in general, it is of interest to relate properties of N and $$\mathscr {C}_N$$ C N . Here, we systematically investigate the relationships of several well-studied classes of networks and their clustering systems. The main results are correspondences of classes of networks and clustering systems of the following form: If N is a network of type $$\mathbb {X}$$ X , then $$\mathscr {C}_N$$ C N satisfies $$\mathbb {Y}$$ Y , and conversely if $$\mathscr {C}$$ C is a clustering system satisfying $$\mathbb {Y},$$ Y , then there is network N of type $$\mathbb {X}$$ X such that $$\mathscr {C}\subseteq \mathscr {C}_N$$ C ⊆ C N .This, in turn, allows us to investigate the mutual dependencies between the distinct types of networks in much detail.

19 February 2021 in Journal of Mathematical Biology
Verified
Journal Article
Open access
PDF file
DSDavid Schaller
David Schaller
MGManuela Geiß
Manuela Geiß
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
MHMarc Hellmuth
Marc Hellmuth
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 match. Incorrect orthology assignments therefore are always false positives in the reciprocal best match graph. We consider duplication/loss scenarios and characterize unambiguous false-positive (u-fp) orthology assignments, that is, edges in the best match graphs (BMGs) that cannot correspond to orthologs for any gene tree that explains the BMG. Moreover, we provide a polynomial-time algorithm to identify allu-fporthology assignments in a BMG. Simulations show that at least $$75\%$$75% of all incorrect orthology assignments can be detected in this manner. All results rely only on the structure of the BMGs andnoton anya prioriknowledge about underlying gene or species trees.

1 April 2021 in Theoretical Computer Science
Verified
Journal Article
Open access
DSDavid Schaller
David Schaller
PSPeter F. Stadler
Peter F. Stadler
MHMarc Hellmuth
Marc Hellmuth
1

9 April 2020 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
MGManuela Geiß
Manuela Geiß
DSDavid Schaller
David Schaller
ASAlitzel López Sánchez
Alitzel López Sánchez
MLMarcos González Laffitte
Marcos González Laffitte
MRMaribel Hernández Rosales
Maribel Hernández Rosales
Background: Many of the commonly used methods for orthology detection start from mutually most similar pairs of genes (reciprocal best hits) as an approximation for evolutionary most closely related pairs of genes (reciprocal best matches). This approximation of best matches by best hits becomes exact for ultrametric dissimilarities, i.e., under the Molecular Clock Hypothesis. It fails, however, whenever there are large lineage specific rate variations among paralogous genes. In practice, this introduces a high level of noise into the input data for best-hit-based orthology detection methods.Results: If additive distances between genes are known, then evolutionary most closely related pairs can be identified by considering certain quartets of genes provided that in each quartet the outgroup relative to the remaining three genes is known.A prioriknowledge of underlying species phylogeny greatly facilitates the identification of the required outgroup. Although the workflow remains a heuristic since the correct outgroup cannot be determined reliably in all cases, simulations with lineage specific biases and rate asymmetries show that nearly perfect results can be achieved. In a realistic setting, where distances data have to be estimated from sequence data and hence are noisy, it is still possible to obtain highly accurate sets of best matches.Conclusion: Improvements of tree-free orthology assessment methods can be expected from a combination of the accurate inference of best matches reported here and recent mathematical advances in the understanding of (reciprocal) best match graphs and orthology relations.Availability: Accompanying software is available athttps://github.com/david-schaller/AsymmeTree.

3 July 2021 in Journal of Mathematical Biology
Verified
Journal Article
Open access
PDF file
DSDavid Schaller
David Schaller
Manuel LafondManuel Lafond
Manuel Lafond
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
NWNicolas Wieseke
Nicolas Wieseke
MHMarc Hellmuth
Marc Hellmuth
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 later-divergence-time (LDT) graph, whose vertices correspond to genes colored by their species. We investigate these graphs in the setting of relaxed scenarios, i.e., evolutionary scenarios that encompass all commonly used variants of duplication-transfer-loss scenarios in the literature. We characterize LDT graphs as a subclass of properly vertex-colored cographs, and provide a polynomial-time recognition algorithm as well as an algorithm to construct a relaxed scenario that explains a given LDT. An edge in an LDT graph implies that the two corresponding genes are separated by at least one HGT event. The converse is not true, however. We show that the complete xenology relation is described by an rs-Fitch graph, i.e., a complete multipartite graph satisfying constraints on the vertex coloring. This class of vertex-colored graphs is also recognizable in polynomial time. We finally address the question “how much information about all HGT events is contained in LDT graphs” with the help of simulations of evolutionary scenarios with a wide range of duplication, loss, and HGT events. In particular, we show that a simple greedy graph editing scheme can be used to efficiently detect HGT events that are implicitly contained in LDT graphs.

7 August 2022 in Software
Verified
Journal Article
Open access
PDF file
DSDavid Schaller
David Schaller
MHMarc Hellmuth
Marc Hellmuth
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
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, conversion, and horizontal transfer to evolve gene families along the species tree. To generate realistic scenarios, evolution rate heterogeneity from various sources is modeled. Finally, nucleotide or amino acid sequences (optionally with indels, among-site rate heterogeneity, and invariant sites) can be simulated along the gene phylogenies. For all steps, users can choose from a spectrum of alternative methods and parameters. These choices include most options that are commonly used in comparable tools but also some that are usually not found, such as the innovation model for species evolution. While output files for each individual step can be generated, AsymmeTree is primarily intended to be integrated in complex Python pipelines designed to assess the performance of data analysis methods. It allows the user to interact with, analyze, and possibly manipulate the simulated scenarios. AsymmeTree is freely available on GitHub.