Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bertram Müller-Myhsok

dblp:47/9780 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
0.222011
Epistasis detection on quantitative phenotypes by exhaustive enumeration using GPUs · Bioinform. 2011
vipR: variant identification in pooled DNA using R · Bioinform. 2011
Bioinformatics and computational biology › genomics › genome-wide association study
epistasis detection
0.112011
Epistasis detection on quantitative phenotypes by exhaustive enumeration using GPUs · Bioinform. 2011
Bioinformatics and computational biology › genomics
genome-wide association study
0.112011
Epistasis detection on quantitative phenotypes by exhaustive enumeration using GPUs · Bioinform. 2011
Bioinformatics and computational biology › sequence analysis
sequencing error modeling
0.112011
vipR: variant identification in pooled DNA using R · Bioinform. 2011
Bioinformatics and computational biology › genomics
variant calling
0.112011
vipR: variant identification in pooled DNA using R · Bioinform. 2011
GPUs and heterogeneous computing
GPU computing
0.012011
Epistasis detection on quantitative phenotypes by exhaustive enumeration using GPUs · Bioinform. 2011

Methods — techniques the papers use, named apart from their topics

hilbert-schmidt independence criterion · 0.2exhaustive enumeration · 0.2statistical hypothesis testing · 0.1skellam distribution · 0.1
YearPublicationVenuePosition
2020 DeepWAS: Multivariate genotype-phenotype associations by directly integrating regulatory information using deep learning
abstract
Genome-wide association studies (GWAS) identify genetic variants associated with traits or diseases. GWAS never directly link variants to regulatory mechanisms. Instead, the functional annotation of variants is typically inferred by post hoc analyses. A specific class of deep learning-based methods allows for the prediction of regulatory effects per variant on several cell type-specific chromatin features. We here describe "DeepWAS", a new approach that integrates these regulatory effect predictions of single variants into a multivariate GWAS setting. Thereby, single variants associated with a trait or disease are directly coupled to their impact on a chromatin feature in a cell type. Up to 61 regulatory SNPs, called dSNPs, were associated with multiple sclerosis (MS, 4,888 cases and 10,395 controls), major depressive disorder (MDD, 1,475 cases and 2,144 controls), and height (5,974 individuals). These variants were mainly non-coding and reached at least nominal significance in classical GWAS. The prediction accuracy was higher for DeepWAS than for classical GWAS models for 91% of the genome-wide significant, MS-specific dSNPs. DSNPs were enriched in public or cohort-matched expression and methylation quantitative trait loci and we demonstrated the potential of DeepWAS to generate testable functional hypotheses based on genotype data alone. DeepWAS is available at https://github.com/cellmapslab/DeepWAS.
Janine Knauer-Arloth, Gökcen Eraslan, Till F. M. Andlauer, Jade Martins, Stella Iurato, Brigitte Kühnel, Melanie Waldenberger, Josef Frank, Ralf Gold, Bernhard Hemmer, Felix Luessi, Sandra Nischwitz, Friedemann Paul, Heinz Wiendl, Christian Gieger, Stefanie Heilmann-Heimbach, Tim Kacprowski, Matthias Laudes, Thomas Meitinger, Annette Peters, Rajesh Rawal, Konstantin Strauch, Susanne Lucae, Bertram Müller-Myhsok, Marcella Rietschel, Fabian J. Theis, Elisabeth B. Binder, Nikola S. Müller
PLoS Comput. Biol.24
2011 vipR: variant identification in pooled DNA using R
abstract
MOTIVATION: High-throughput-sequencing (HTS) technologies are the method of choice for screening the human genome for rare sequence variants causing susceptibility to complex diseases. Unfortunately, preparation of samples for a large number of individuals is still very cost- and labor intensive. Thus, recently, screens for rare sequence variants were carried out in samples of pooled DNA, in which equimolar amounts of DNA from multiple individuals are mixed prior to sequencing with HTS. The resulting sequence data, however, poses a bioinformatics challenge: the discrimination of sequencing errors from real sequence variants present at a low frequency in the DNA pool. RESULTS: Our method vipR uses data from multiple DNA pools in order to compensate for differences in sequencing error rates along the sequenced region. More precisely, instead of aiming at discriminating sequence variants from sequencing errors, vipR identifies sequence positions that exhibit significantly different minor allele frequencies in at least two DNA pools using the Skellam distribution. The performance of vipR was compared with three other models on data from a targeted resequencing study of the TMEM132D locus in 600 individuals distributed over four DNA pools. Performance of the methods was computed on SNPs that were also genotyped individually using a MALDI-TOF technique. On a set of 82 sequence variants, vipR achieved an average sensitivity of 0.80 at an average specificity of 0.92, thus outperforming the reference methods by at least 0.17 in specificity at comparable sensitivity. AVAILABILITY: The code of vipR is freely available via: http://sourceforge.net/projects/htsvipr/ CONTACT: [email protected].
André Altmann, Peter Weber, Carina Quast, Monika Rex-Haffner, Elisabeth B. Binder, Bertram Müller-Myhsok
Bioinform.6
2011 Epistasis detection on quantitative phenotypes by exhaustive enumeration using GPUs
abstract
MOTIVATION: In recent years, numerous genome-wide association studies have been conducted to identify genetic makeup that explains phenotypic differences observed in human population. Analytical tests on single loci are readily available and embedded in common genome analysis software toolset. The search for significant epistasis (gene-gene interactions) still poses as a computational challenge for modern day computing systems, due to the large number of hypotheses that have to be tested. RESULTS: In this article, we present an approach to epistasis detection by exhaustive testing of all possible SNP pairs. The search strategy based on the Hilbert-Schmidt Independence Criterion can help delineate various forms of statistical dependence between the genetic markers and the phenotype. The actual implementation of this search is done on the highly parallelized architecture available on graphics processing units rendering the completion of the full search feasible within a day. AVAILABILITY: The program is available at http://www.mpipsykl.mpg.de/epigpuhsic/. CONTACT: [email protected].
Tony Kam-Thong, Benno Pütz, Nazanin Karbalai, Bertram Müller-Myhsok, Karsten M. Borgwardt
Bioinform.4
2011 Efficient branch-and-bound techniques for two-locus association mapping
abstract
Material and methods For a large-scale dataset of over 200,000 SNPs from about 200 individuals together with several phenotypes, published by Atwell et al. [1], we develop efficient methods to find pairs of SNPs which are strongly associated with the phenotype. As an exhaustive search of all possible combinations of interacting SNPs is often unfeasible, even when only considering pairs of interacting SNPs, the challenge is to find methods which avoid an exhaustive search but can still guarantee to find the causal pair. We propose two distinct approaches to efficiently determine the t top-scoring pairs of SNPs.
Karin Klotzbücher, Yasushi Kobayashi, Nino Shervashidze, Oliver Stegle, Bertram Müller-Myhsok, Detlef Weigel, Karsten M. Borgwardt
BMC Bioinform.5