Peter F. Stadler

Peter F. Stadler
University of Leipzig · Institute of Computer Science

Dr.rer.nat.

About

1,259
Publications
150,230
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
61,238
Citations
Additional affiliations
March 2009 - present
Max Planck Institute for Mathematics in the Sciences
Position
  • External Scientific Member
January 2007 - December 2013
July 2005 - present
Fraunhofer Institute for Cell Therapy and Immunology IZI
Position
  • Consultant

Publications

Publications (1,259)
Article
The modular decomposition of a symmetric map δ:X×X→Υ (or, equivalently, a set of pairwise-disjoint symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features of δ in terms of a labeled tree. A map δ is explained by a vertex-labeled rooted tree (T,t) if the label δ(x,y) coincides...
Chapter
Full-text available
MicroRNAs are important regulators in many eukaryotic lineages. Typical miRNAs have a length of about 22nt and are processed from precursors that form a characteristic hairpin structure. Once they appear in a genome, miRNAs are among the best-conserved elements in both animal and plant genomes. Functionally, they play an important role in particula...
Article
Full-text available
DNA methylation is a crucial, abundant mechanism of gene regulation in vertebrates. It is less prevalent in many other metazoan organisms and completely absent in some key model species, such as Drosophila melanogaster and Caenorhabditis elegans . We report here a comprehensive study of the presence and absence of DNA methyltransferases (DNMTs) in...
Article
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 determine whether a BMG is binary-explainable, i.e., whether it can be explained by a fully resolved gene tree and, if so, to construct such a tree. Moreover, we show that...
Article
Removal of the 5' leader region is an essential step in the maturation of tRNA molecules in all domains of life. This reaction is catalyzed by various RNase P activities, ranging from ribonucleoproteins with ribozyme activity to protein-only forms. In Escherichia coli, the efficiency of RNase P mediated cleavage can be controlled by computationally...
Article
Full-text available
Thlaspi arvense (field pennycress) is being domesticated as a winter annual oilseed crop capable of improving ecosystems and intensifying agricultural productivity without increasing land use. It is a selfing diploid with a short life cycle and is amenable to genetic manipulations, making it an accessible field-based model species for genetics and...
Preprint
Full-text available
Reaction networks (RNs) comprise a set $X$ of species and a set $\mathscr{R}$ of reactions $Y\to Y'$, each converting a multiset of educts $Y\subseteq X$ into a multiset $Y'\subseteq X$ of products. RNs are equivalent to directed hypergraphs. However, not all RNs necessarily admit a chemical interpretation. Instead, they might contradict fundamenta...
Chapter
Mature microRNAs (miRNAs) are short RNA sequences about 18–24 nucleotide long, which provide the recognition key within RISC for the posttranscriptional regulation of target RNAs. Considering the canonical pathway, mature miRNAs are produced via a multistep process. Their transcription (pri-miRNAs) and first processing step via the microprocessor c...
Article
Full-text available
Self-cleaving ribozymes are catalytically active RNAs that cleave themselves into a 5′-fragment with a 2′,3′-cyclic phosphate and a 3′-fragment with a 5′-hydroxyl. They are widely applied for the construction of synthetic RNA devices and RNA-based therapeutics. However, the targeted discovery of self-cleaving ribozymes remains a major challenge. We...
Article
Full-text available
Long non-coding RNAs (lncRNAs) are widely recognized as important regulators of gene expression. Their molecular functions range from miRNA sponging to chromatin-associated mechanisms, leading to effects in disease progression and establishing them as diagnostic and therapeutic targets. Still, only a few representatives of this diverse class of RNA...
Article
Full-text available
Tunicates are the sister group of vertebrates and thus occupy a key position for investigations into vertebrate innovations as well as into the consequences of the vertebrate-specific genome duplications. Nevertheless, tunicate genomes have not been studied extensively in the past, and comparative studies of tunicate genomes have remained scarce. T...
Preprint
Full-text available
Historical processes manifest remarkable diversity. Nevertheless, scholars have long attempted to identify patterns and categorize historical actors and influences with some success. A stochastic process framework provides a structured approach for the analysis of large historical datasets that allows for detection of sometimes surprising patterns,...
Article
Full-text available
Background The supertree problem, i.e., the task of finding a common refinement of a set of rooted trees is an important topic in mathematical phylogenetics. The special case of a common leaf set L is known to be solvable in linear time. Existing approaches refine one input tree using information of the others and then test whether the results are...
Article
Full-text available
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 such partitions P from sequence similarity or evolutionary distances without any a priory knowledge about the unde...
Article
Full-text available
Alignments, i.e., position-wise comparisons of two or more strings or ordered lists are of utmost practical importance in computational biology and a host of other fields, including historical linguistics and emerging areas of research in the Digital Humanities. The problem is well-known to be computationally hard as soon as the number of input str...
Article
Full-text available
Background DNA methylation age (mAge), a methylation biomarker for the aging process, might serve as a more accurate predictor of morbidity and aging status than chronological age. We evaluated the role of multiple factors, including fat deposition, cardiometabolic risk factors and lifestyle weight-loss intervention, on the deviation of mAge from c...
Preprint
Full-text available
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 such partitions $\mathcal{P}$ from sequence similarity or evolutionary distances without any a priory knowledge...
Article
Full-text available
The expanding scope and scale of next generation sequencing experiments in ecological plant epigenetics brings new challenges for computational analysis. Existing tools built for model data may not address the needs of users looking to apply these techniques to non-model species, particularly on a population or community level. Here we present a to...
Article
Full-text available
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median graphs. More specifically, we characterize when a planar graph G is a median graph in terms of forbidden subgr...
Preprint
Full-text available
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median graphs. More specifically, we characterize when a planar graph $G$ is a median graph in terms of forbidden sub...
Article
Full-text available
Alzheimer's disease (AD) is a progressive neurodegenerative disorder with typical neuropathological hallmarks, such as neuritic plaques and neurofibrillary tangles, preferentially found at layers III and V. The distribution of both hallmarks provides the basis for the staging of AD, following a hierarchical pattern throughout the cerebral cortex. T...
Preprint
Full-text available
The periodic system arose from knowledge about substances, which constitute the chemical space. Despite the importance of this interplay, little is known about how the expanding space affected the system. Here we show, by analysing the space between 1800 and 1869, how the periodic system evolved until its formulation. We found that after an unstabl...
Preprint
The periodic system arose from knowledge about substances, which constitute the chemical space. Despite the importance of this interplay, little is known about how the expanding space affected the system. Here we show, by analysing the space between 1800 and 1869, how the periodic system evolved until its formulation. We found that after an unstabl...
Article
Full-text available
Alzheimerʼs disease (AD) is a neurodegenerative disorder of unknown cause with complex genetic and environmental traits. While AD is extremely prevalent in human elderly, it hardly occurs in non-primate mammals and even non-human-primates develop only an incomplete form of the disease. This specificity of AD to human clearly implies a phylogenetic...
Article
Full-text available
Objective Human white adipose tissue (AT) is a metabolically active organ with distinct depot-specific functions. Despite their locations close to the gastrointestinal tract, mesenteric AT and epiploic AT (epiAT) have only scarcely been investigated. Here, we aim to characterise these ATs in-depth and estimate their contribution to alterations in w...
Article
Full-text available
The high complexity found in microbial communities makes the identification of microbial interactions challenging. To address this challenge, we present OrtSuite, a flexible workflow to predict putative microbial interactions based on genomic content of microbial communities and targeted to specific ecosystem processes. The pipeline is composed of...
Preprint
Full-text available
Quasi-best match graphs (qBMGs) are a hereditary class of directed, properly vertex-colored graphs. They arise naturally in mathematical phylogenetics as a generalization of best match graphs, which formalize the notion of evolutionary closest relatedness of genes (vertices) in multiple species (vertex colors). They are explained by rooted trees wh...
Article
Full-text available
Species of littoral freshwater environments in regions with continental climate experience pronounced seasonal temperature changes. Coping with long cold winters and hot summers requires specific physiological and behavioral adaptations. Endemic amphipods of Lake Baikal, Eulimnogammarus verrucosus and Eulimnogammarus cyaneus, show high metabolic ac...
Article
The network Laplacian spectral density calculation is critical in many fields, including physics, chemistry, statistics, and mathematics. It is highly computationally intensive, limiting the analysis to small networks. Therefore, we present two efficient alternatives: one based on the network’s edges and another on the degrees. The former gives the...
Article
Hypergraphs serve as models of complex networks that capture more general structures than binary relations. For graphs, a wide array of statistics has been devised to gauge different aspects of their structures. Hypergraphs lack behind in this respect. The Forman–Ricci curvature is a statistics for graphs based on Riemannian geometry, which stresse...
Article
Full-text available
Background Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics as a representation of the pairwise most closely related genes among multiple species. An arc connects a gene x with a gene y from another species (vertex color) Y whenever it is one of the phylogenetically closest relatives of x...
Article
Alignments of discrete objects can be constructed in a very general setting as super-objects from which the constituent objects are recovered by means of projections. Here, we focus on contact maps, i.e. undirected graphs with an ordered set of vertices. These serve as natural discretizations of RNA and protein structures. In the general case, the...
Preprint
Full-text available
Thlaspi arvense (field pennycress) is being domesticated as a winter annual oilseed crop capable of improving ecosystems and intensifying agricultural productivity without increasing land use. It is a selfing diploid with a short life cycle and is amenable to genetic manipulations, making it an accessible field-based model species for genetics and...
Preprint
DNA methylation is a crucial, abundant mechanism of gene regulation in vertebrates. It is less prevalent in many other metazoan organisms and completely absent in some key model species, such as D. melanogaster and C. elegans. We report here a comprehensive study of the presence and absence of DNA methyltransferases (DNMTs) in 138 Ecdysozoa, coveri...
Article
Motivation: Accurate assembly of RNA-seq is a crucial step in many analytic tasks such as gene annotation or expression studies. Despite ongoing research, progress on traditional single sample assembly has brought no major breakthrough. Multi-sample RNA-Seq experiments provide more information than single sample datasets and thus constitute a prom...
Preprint
Autocatalysis is a deceptively simple concept, referring to the situation that a chemical species $X$ catalyzes its own formation. From the perspective of chemical kinetics, autocatalysts show a regime of super-linear growth. Given a chemical reaction network, however, it is not at all straightforward to identify species that are autocatalytic in t...
Preprint
Full-text available
A rooted tree $T$ with vertex labels $t(v)$ and set-valued edge labels $\lambda(e)$ defines maps $\delta$ and $\varepsilon$ on the pairs of leaves of $T$ by setting $\delta(x,y)=q$ if the last common ancestor $\text{lca}(x,y)$ of $x$ and $y$ is labeled $q$, and $m\in \varepsilon(x,y)$ if $m\in\lambda(e)$ for at least one edge $e$ along the path fro...
Article
Full-text available
B cells have the unique property to somatically alter their immunoglobulin (IG) genes by V(D)J recombination, somatic hypermutation (SHM) and class-switch recombination (CSR). Aberrant targeting of these mechanisms is implicated in lymphomagenesis, but the mutational processes are poorly understood. By performing whole genome and transcriptome sequ...
Preprint
Full-text available
The problem of finding a common refinement of a set of rooted trees with common leaf set L appears naturally in mathematical phylogenetics whenever poorly resolved information on the same taxa from different sources is to be reconciled. This constitutes a special case of the well-studied supertree problem, where the leaf sets of the input trees may...
Article
Full-text available
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 g...
Article
Full-text available
The tumor suppressor phosphatase and tensin homolog (PTEN) negatively regulates the insulin signaling pathway. Germline PTEN pathogenic variants cause PTEN Hamartoma Tumor Syndrome (PHTS), associated with lipoma development in children. Adipose progenitor cells (APCs) lose their capacity to differentiate into adipocytes during continuous culture, w...
Preprint
Full-text available
The high complexity found in microbial communities makes the identification of microbial interactions challenging. To address this challenge, we present OrtSuite, a flexible workflow to predict putative microbial interactions based on genomic content of microbial communities and targeted to specific ecosystem processes. The pipeline is composed of...
Article
Full-text available
Background Advances in genome sequencing over the last years have lead to a fundamental paradigm shift in the field. With steadily decreasing sequencing costs, genome projects are no longer limited by the cost of raw sequencing data, but rather by computational problems associated with genome assembly. There is an urgent demand for more efficient a...
Article
Full-text available
Background Colorectal cancer (CRC) is a heterogeneous cancer. Its treatment depends on its anatomical site and distinguishes between colon, rectum, and rectosigmoid junction cancer. This study aimed to identify diagnostic and prognostic biomarkers using networks of CRC-associated transcripts that can be built based on competing endogenous RNAs (ceR...
Chapter
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 determine whether a BMG can be explained by a fully resolved gene tree and, if so, to construct such a tree. Moreover, we show that all such binary trees are refinements o...
Article
Full-text available
Dictyostelium discoideum is a social amoeba, which on starvation develops from a single-cell state to a multicellular fruiting body. This developmental process is accompanied by massive changes in gene expression, which also affect non-coding RNAs. Here, we investigate how tRNAs as key regulators of the translation process are affected by this tran...
Article
Full-text available
Background Small Proteins have received increasing attention in recent years. They have in particular been implicated as signals contributing to the coordination of bacterial communities. In genome annotations they are often missing or hidden among large numbers of hypothetical proteins because genome annotation pipelines often exclude short open r...
Preprint
Full-text available
Metabolic self-synchronization in yeast cultures highlights significant gaps in our understanding of fundamental cellular processes. The oscillation percolates throughout cellular physiology, and the transcriptome oscillates between expression of genes encoding for biosynthesis and growth, and for catabolism and stress-response. However, long prote...
Article
Full-text available
The European green lizards of the Lacerta viridis complex consist of two closely related species, L. viridis and L. bilineata that split less than 7 million years ago in the presence of gene flow. Recently, a third lineage, referred to as the “Adriatic” was described within the L. viridis complex distributed from Slovenia to Greece. However, whethe...
Article
Full-text available
Two errors in the article Best Match Graphs (Geiß et al. in JMB 78: 2015–2057, 2019) are corrected. One concerns the tacit assumption that digraphs are sink-free, which has to be added as an additional precondition in Lemma 9, Lemma 11, Theorem 4. Correspondingly, Algorithm 2 requires that its input is sink-free. The second correction concerns an a...
Article
Background and Aims In the CENTRAL trial context, we found diverse liver fat dynamics in response to different dietary interventions. Epigenetic mechanisms may contribute to the intraindividual variation. Moreover, genetic factors are involved in developing non‐alcoholic fatty‐liver disease (NAFLD), a disease reflected by an increase in intrahepati...
Preprint
Full-text available
The question whether a partition P and a hierarchy H or a tree-like split system S are compatible naturally arises in a wide range of classification problems. In the setting of phylogenetic trees, one asks whether the sets of P coincide with leaf sets of connected components obtained by deleting some edges from the tree T that represents H or S, re...
Article
Full-text available
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees. We prove that the property of a rooted, leaf-colored tree to be least resolved for some BMG is...
Preprint
Full-text available
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees. We prove that the property of a rooted, leaf-colored tree to be least resolved for some BMG is...
Preprint
Full-text available
The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features of $\delta$ in labeled trees. A map $\delta$ is explained by a vertex-labeled rooted tree $(T,t)$ if the labe...
Preprint
Full-text available
Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics and can be approximated with the help of similarity measures between gene sequences, albeit not without errors. The corresponding graph editing problem can be used as a means of error correction. Since the arc set modification problems for B...
Chapter
The simplest class of structures formed by N≥2 interacting RNAs consists of all crossing-free base pairs formed over linear arrangements of the constituent RNA sequences. For each permutation of the N strands the structure prediction problem is algorithmically very similar – but not identical – to folding of a single, contiguous RNA. The difference...