Peter F. Stadler

Prof. Dr. Peter F. Stadler

1. Bioinformatics Group, Department of Computer Science + Interdisciplinary Center for Bioinformatics + German Center for Integrative Biodiversity Research, University Leipzig, D-04107, Leipzig, Germany
+4
orcid

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

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

Representative Publications

View All Publications
1 November 2013 in Molecular Phylogenetics and Evolution
Verified
Journal Article
Closed access
MBMatthias Bernt
Matthias Bernt
ADAlexander Donath
Alexander Donath
FJFrank Jühling
Frank Jühling
FEFabian Externbrink
Fabian Externbrink
CFCatherine Florentz
Catherine Florentz
Peter F. StadlerPeter F. Stadler
Peter F. Stadler

24 November 2011 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
RLRonny Lorenz
Ronny Lorenz
SBStephan H Bernhart
Stephan H Bernhart
CSChristian Höner zu Siederdissen
Christian Höner zu Siederdissen
HTHakim Tafer
Hakim Tafer
CFChristoph Flamm
Christoph Flamm
IHIvo Hofacker
Ivo Hofacker
Secondary structure forms an important intermediate level of description of nucleic acids that encapsulates the dominating part of the folding energy, is often well conserved in evolution, and is routinely used as a basis to explain experimental findings. Based on carefully measured thermodynamic parameters, exact dynamic programming algorithms can be used to compute ground states, base pairing probabilities, as well as thermodynamic properties.

5 February 2020 in Nature
Verified
Journal Article
Open access
PDF file
Taobo HuTaobo Hu
Taobo Hu
LALauri A. Aaltonen
Lauri A. Aaltonen
FAFederico Abascal
Federico Abascal
AAAdam Abeshouse
Adam Abeshouse
HAHiroyuki Aburatani
Hiroyuki Aburatani
CMChristian von Mering
Christian von Mering
Cancer is driven by genetic change, and the advent of massively parallel sequencing has enabled systematic documentation of this variation at the whole-genome scale1–3. Here we report the integrative analysis of 2,658 whole-cancer genomes and their matching normal tissues across 38 tumour types from the Pan-Cancer Analysis of Whole Genomes (PCAWG) Consortium of the International Cancer Genome Consortium (ICGC) and The Cancer Genome Atlas (TCGA). We describe the generation of the PCAWG resource, facilitated by international data sharing using compute clouds. On average, cancer genomes contained 4–5 driver mutations when combining coding and non-coding genomic elements; however, in around 5% of cases no drivers were identified, suggesting that cancer driver discovery is not yet complete. Chromothripsis, in which many clustered structural variants arise in a single catastrophic event, is frequently an early event in tumour evolution; in acral melanoma, for example, these events precede most somatic point mutations and affect several cancer-associated genes simultaneously. Cancers with abnormal telomere maintenance often originate from tissues with low replicative activity and show several mechanisms of preventing telomere attrition to critical levels. Common and rare germline variants affect patterns of somatic mutation, including point mutations, structural variants and somatic retrotransposition. A collection of papers from the PCAWG Consortium describes non-coding mutations that drive cancer beyond those in the TERT promoter4; identifies new signatures of mutational processes that cause base substitutions, small insertions and deletions and structural variation5,6; analyses timings and patterns of tumour evolution7; describes the diverse transcriptional consequences of somatic mutation on splicing, expression levels, fusion genes and promoter activity8,9; and evaluates a range of more-specialized features of cancer genomes8,10–18.

8 June 2007 in Science
Verified
Journal Article
Closed access
PDF file
PKPhilipp Kapranov
Philipp Kapranov
JCJill Cheng
Jill Cheng
SDSujit Dike
Sujit Dike
DNDavid A. Nix
David A. Nix
RDRadharani Duttagupta
Radharani Duttagupta
TGThomas R. Gingeras
Thomas R. Gingeras
Significant fractions of eukaryotic genomes give rise to RNA, much of which is unannotated and has reduced protein-coding potential. The genomic origins and the associations of human nuclear and cytosolic polyadenylated RNAs longer than 200 nucleotides (nt) and whole-cell RNAs less than 200 nt were investigated in this genome-wide study. Subcellular addresses for nucleotides present in detected RNAs were assigned, and their potential processing into short RNAs was investigated. Taken together, these observations suggest a novel role for some unannotated RNAs as primary transcripts for the production of short RNAs. Three potentially functional classes of RNAs have been identified, two of which are syntenically conserved and correlate with the expression state of protein-coding genes. These data support a highly interleaved organization of the human transcriptome.

1 February 1994 in Monatshefte für Chemie - Chemical Monthly
Verified
Journal Article
Closed access
PDF file
IHIvo Hofacker
Ivo Hofacker
WFW. Fontana
W. Fontana
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
LBL. S. Bonhoeffer
L. S. Bonhoeffer
MTM. Tacker
M. Tacker
PSP. Schuster
P. Schuster

28 April 2011 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MLMarcus Lechner
Marcus Lechner
SFSven Findeiß
Sven Findeiß
LSLydia Steiner
Lydia Steiner
MMManja Marz
Manja Marz
Peter F. StadlerPeter F. Stadler
Peter F. Stadler
SPSonja Prohaska
Sonja Prohaska
Orthology analysis is an important part of data analysis in many areas of bioinformatics such as comparative genomics and molecular phylogenetics. The ever-increasing flood of sequence data, and hence the rapidly increasing number of genomes that can be compared simultaneously, calls for efficient software tools as brute-force approaches with quadratic memory requirements become infeasible in practise. The rapid pace at which new data become available, furthermore, makes it desirable to compute genome-wide orthology relations for a given dataset rather than relying on relations listed in databases.