Ulrich Bodenhofer

Prof. Ulrich Bodenhofer

University of Applied Sciences Upper Austria, Hagenberg Campus
orcid

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
26 August 2015 in Bioinformatics
Verified
Journal Article
Open access
PDF file
Ulrich BodenhoferUlrich Bodenhofer
Ulrich Bodenhofer
EBEnrico Bonatesta
Enrico Bonatesta
CHChristoph Horejš-Kainrath
Christoph Horejš-Kainrath
SHSepp Hochreiter
Sepp Hochreiter
Summary: Although the R platform and the add-on packages of the Bioconductor project are widely used in bioinformatics, the standard task of multiple sequence alignment has been neglected so far. The msa package, for the first time, provides a unified R interface to the popular multiple sequence alignment algorithms ClustalW, ClustalOmega and MUSCLE. The package requires no additional software and runs on all major platforms. Moreover, the msa package provides an R interface to the powerful package shade which allows for flexible and customizable plotting of multiple sequence alignments. Availability and implementation: msa is available via the Bioconductor project: http://bioconductor.org/packages/release/bioc/html/msa.html. Further information and the R code of the example presented in this paper are available at http://www.bioinf.jku.at/software/msa/. Contact: bodenhofer@bioinf.jku.at or msa@bioinf.jku.at

6 July 2011 in Bioinformatics
Verified
Journal Article
Open access
PDF file
Ulrich BodenhoferUlrich Bodenhofer
Ulrich Bodenhofer
AKAndreas Kothmeier
Andreas Kothmeier
SHSepp Hochreiter
Sepp Hochreiter
Summary: Affinity propagation (AP) clustering has recently gained increasing popularity in bioinformatics. AP clustering has the advantage that it allows for determining typical cluster members, the so-called exemplars. We provide an R implementation of this promising new clustering technique to account for the ubiquity of R in bioinformatics. This article introduces the package and presents an application from structural biology. Availability: The R package apcluster is available via CRAN—The Comprehensive R Archive Network: http://cran.r-project.org/web/packages/apcluster Contact:apcluster@bioinf.jku.at; bodenhofer@bioinf.jku.at

2 January 2012 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
GKGünter Klambauer
Günter Klambauer
KSKarin Schwarzbauer
Karin Schwarzbauer
AMAndreas Mayr
Andreas Mayr
DCDjork-Arné Clevert
Djork-Arné Clevert
AMAndreas Mitterecker
Andreas Mitterecker
SHSepp Hochreiter
Sepp Hochreiter
Quantitative analyses of next-generation sequencing (NGS) data, such as the detection of copy number variations (CNVs), remain challenging. Current methods detect CNVs as changes in the depth of coverage along chromosomes. Technological or genomic variations in the depth of coverage thus lead to a high false discovery rate (FDR), even upon correction for GC content. In the context of association studies between CNVs and disease, a high FDR means many false CNVs, thereby decreasing the discovery power of the study after correction for multiple testing. We propose ‘Copy Number estimation by a Mixture Of PoissonS’ (cn.MOPS), a data processing pipeline for CNV detection in NGS data. In contrast to previous approaches, cn.MOPS incorporates modeling of depths of coverage across samples at each genomic position. Therefore, cn.MOPS is not affected by read count variations along chromosomes. Using a Bayesian approach, cn.MOPS decomposes variations in the depth of coverage across samples into integer copy numbers and noise by means of its mixture components and Poisson distributions, respectively. The noise estimate allows for reducing the FDR by filtering out detections having high noise that are likely to be false detections. We compared cn.MOPS with the five most popular methods for CNV detection in NGS data using four benchmark datasets: (i) simulated data, (ii) NGS data from a male HapMap individual with implanted CNVs from the X chromosome, (iii) data from HapMap individuals with known CNVs, (iv) high coverage data from the 1000 Genomes Project. cn.MOPS outperformed its five competitors in terms of precision (1–FDR) and recall for both gains and losses in all benchmark data sets. The software cn.MOPS is publicly available as an R package at http://www.bioinf.jku.at/software/cnmops/ and at Bioconductor.

23 April 2010 in Bioinformatics
Verified
Journal Article
Open access
PDF file
SHSepp Hochreiter
Sepp Hochreiter
Ulrich BodenhoferUlrich Bodenhofer
Ulrich Bodenhofer
MHMartin Heusel
Martin Heusel
AMAndreas Mayr
Andreas Mayr
AMAndreas Mitterecker
Andreas Mitterecker
DCDjork-Arné Clevert
Djork-Arné Clevert
Motivation: Biclustering of transcriptomic data groups genes and samples simultaneously. It is emerging as a standard tool for extracting knowledge from gene expression measurements. We propose a novel generative approach for biclustering called ‘FABIA: Factor Analysis for Bicluster Acquisition’. FABIA is based on a multiplicative model, which accounts for linear dependencies between gene expression and conditions, and also captures heavy-tailed distributions as observed in real-world transcriptomic data. The generative framework allows to utilize well-founded model selection methods and to apply Bayesian techniques. Results: On 100 simulated datasets with known true, artificially implanted biclusters, FABIA clearly outperformed all 11 competitors. On these datasets, FABIA was able to separate spurious biclusters from true biclusters by ranking biclusters according to their information content. FABIA was tested on three microarray datasets with known subclusters, where it was two times the best and once the second best method among the compared biclustering approaches. Availability: FABIA is available as an R package on Bioconductor (http://www.bioconductor.org). All datasets, results and software are available at http://www.bioinf.jku.at/software/fabia/fabia.html Contact:hochreit@bioinf.jku.at Supplementary information: Supplementary data are available at Bioinformatics online.

15 October 2017 in The Journal of Immunology
Verified
Journal Article
Closed access
PDF file
VGVictor Greiff
Victor Greiff
CWCédric R. Weber
Cédric R. Weber
JPJohannes Palme
Johannes Palme
Ulrich BodenhoferUlrich Bodenhofer
Ulrich Bodenhofer
EMEnkelejda Miho
Enkelejda Miho
SRSai T. Reddy
Sai T. Reddy
Recent studies have revealed that immune repertoires contain a substantial fraction of public clones, which may be defined as Ab or TCR clonal sequences shared across individuals. It has remained unclear whether public clones possess predictable sequence features that differentiate them from private clones, which are believed to be generated largely stochastically. This knowledge gap represents a lack of insight into the shaping of immune repertoire diversity. Leveraging a machine learning approach capable of capturing the high-dimensional compositional information of each clonal sequence (defined by CDR3), we detected predictive public clone and private clone–specific immunogenomic differences concentrated in CDR3’s N1–D–N2 region, which allowed the prediction of public and private status with 80% accuracy in humans and mice. Our results unexpectedly demonstrate that public, as well as private, clones possess predictable high-dimensional immunogenomic features. Our support vector machine model could be trained effectively on large published datasets (3 million clonal sequences) and was sufficiently robust for public clone prediction across individuals and studies prepared with different library preparation and high-throughput sequencing protocols. In summary, we have uncovered the existence of high-dimensional immunogenomic rules that shape immune repertoire diversity in a predictable fashion. Our approach may pave the way for the construction of a comprehensive atlas of public mouse and human immune repertoires with potential applications in rational vaccine design and immunotherapeutics.

1 December 2002 in International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Verified
Journal Article
Closed access
SSSusanne Saminger
Susanne Saminger
RMRadko Mesiar
Radko Mesiar
Ulrich BodenhoferUlrich Bodenhofer
Ulrich Bodenhofer