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

Andreas Beyer

dblp:31/1549 · DBLP profile ↗
← Back
16ranked-venue papers
3as first author
2since 2021 · last 2022
0000-0002-3891-2123ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 12 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1Computer networks · 1Databases, data management, data science and information retrieval · 1 · 1 first-author

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
5 papers
Bioinformatics and computational biology · 97% Computational science and engineering · 3%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
cancer genomics
0.312018
regNet: an R package for network-based propagation of gene expression alterations · Bioinform. 2018
Bioinformatics and computational biology › cancer genomics › cancer driver gene identification
driver gene prediction
0.312018
regNet: an R package for network-based propagation of gene expression alterations · Bioinform. 2018
Bioinformatics and computational biology
gene expression analysis
0.312018
regNet: an R package for network-based propagation of gene expression alterations · Bioinform. 2018
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference
0.312018
regNet: an R package for network-based propagation of gene expression alterations · Bioinform. 2018
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein-protein interaction network analysis
0.222012
Topology of functional networks predicts physical binding of proteins · Bioinform. 2012
DASS: efficient discovery and p-value calculation of substructures in unordered data · Bioinform. 2007
Bioinformatics and computational biology › gene regulation
gene regulation analysis
0.112009
Predicting functionality of protein-DNA interactions by integrating diverse evidence · Bioinform. 2009
Bioinformatics and computational biology
genomics
0.112009
Predicting functionality of protein-DNA interactions by integrating diverse evidence · Bioinform. 2009
Bioinformatics and computational biology › gene regulation › transcription factor binding site prediction
transcription factor binding site analysis
0.112009
Predicting functionality of protein-DNA interactions by integrating diverse evidence · Bioinform. 2009
Data mining
pattern mining
0.112007
DASS: efficient discovery and p-value calculation of substructures in unordered data · Bioinform. 2007
Data mining › pattern mining › interesting pattern mining
significant pattern mining
0.112007
DASS: efficient discovery and p-value calculation of substructures in unordered data · Bioinform. 2007
Computational science and engineering › numerical simulation
dynamic simulation
0.112005
Dynamic simulation of protein complex formation on a genomic scale · Bioinform. 2005
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein complex formation
0.112005
Dynamic simulation of protein complex formation on a genomic scale · Bioinform. 2005
Bioinformatics and computational biology › protein analysis
protein-protein interaction
0.112005
Dynamic simulation of protein complex formation on a genomic scale · Bioinform. 2005

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

network propagation · 0.3statistical significance calculation · 0.1network feature extraction · 0.1modular data mining · 0.1machine learning · 0.1probabilistic framework · 0.1motif binding site analysis · 0.1ChIP-chip · 0.1stochastic simulation · 0.1dynamic model · 0.1
YearPublicationVenuePosition
2022 Regulatory network-based imputation of dropouts in single-cell RNA sequencing data
abstract
Single-cell RNA sequencing (scRNA-seq) methods are typically unable to quantify the expression levels of all genes in a cell, creating a need for the computational prediction of missing values ('dropout imputation'). Most existing dropout imputation methods are limited in the sense that they exclusively use the scRNA-seq dataset at hand and do not exploit external gene-gene relationship information. Further, it is unknown if all genes equally benefit from imputation or which imputation method works best for a given gene. Here, we show that a transcriptional regulatory network learned from external, independent gene expression data improves dropout imputation. Using a variety of human scRNA-seq datasets we demonstrate that our network-based approach outperforms published state-of-the-art methods. The network-based approach performs particularly well for lowly expressed genes, including cell-type-specific transcriptional regulators. Further, the cell-to-cell variation of 11.3% to 48.8% of the genes could not be adequately imputed by any of the methods that we tested. In those cases gene expression levels were best predicted by the mean expression across all cells, i.e. assuming no measurable expression variation between cells. These findings suggest that different imputation methods are optimal for different genes. We thus implemented an R-package called ADImpute (available via Bioconductor https://bioconductor.org/packages/release/bioc/html/ADImpute.html) that automatically determines the best imputation method for each gene in a dataset. Our work represents a paradigm shift by demonstrating that there is no single best imputation method. Instead, we propose that imputation should maximally exploit external information and be adapted to gene-specific features, such as expression level and expression variation across cells.
Ana Carolina Leote, Andreas Beyer
PLoS Comput. Biol.3
2021 Optimizing network propagation for multi-omics data integration
abstract
Network propagation refers to a class of algorithms that integrate information from input data across connected nodes in a given network. These algorithms have wide applications in systems biology, protein function prediction, inferring condition-specifically altered sub-networks, and prioritizing disease genes. Despite the popularity of network propagation, there is a lack of comparative analyses of different algorithms on real data and little guidance on how to select and parameterize the various algorithms. Here, we address this problem by analyzing different combinations of network normalization and propagation methods and by demonstrating schemes for the identification of optimal parameter settings on real proteome and transcriptome data. Our work highlights the risk of a 'topology bias' caused by the incorrect use of network normalization approaches. Capitalizing on the fact that network propagation is a regularization approach, we show that minimizing the bias-variance tradeoff can be utilized for selecting optimal parameters. The application to real multi-omics data demonstrated that optimal parameters could also be obtained by either maximizing the agreement between different omics layers (e.g. proteome and transcriptome) or by maximizing the consistency between biological replicates. Furthermore, we exemplified the utility and robustness of network propagation on multi-omics datasets for identifying ageing-associated genes in brain and liver tissues of rats and for elucidating molecular mechanisms underlying prostate cancer progression. Overall, this work compares different network propagation approaches and it presents strategies for how to use network propagation algorithms to optimally address a specific research question at hand.
Konstantina Charmpi, Manopriya Chokkalingam, Ronja Johnen, Andreas Beyer
PLoS Comput. Biol.4
2018 regNet: an R package for network-based propagation of gene expression alterations
abstract
SUMMARY: Gene expression alterations and potentially underlying gene copy number mutations can be measured routinely in the wet lab, but it is still extremely challenging to quantify impacts of altered genes on clinically relevant characteristics to predict putative driver genes. We developed the R package regNet that utilizes gene expression and copy number data to learn regulatory networks for the quantification of potential impacts of individual gene expression alterations on user-defined target genes via network propagation. We demonstrate the value of regNet by identifying putative major regulators that distinguish pilocytic from diffuse astrocytomas and by predicting putative impacts of glioblastoma-specific gene copy number alterations on cell cycle pathway genes and patient survival. AVAILABILITY AND IMPLEMENTATION: regNet is available for download at https://github.com/seifemi/regNet under GNU GPL-3. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Michael Seifert, Andreas Beyer
Bioinform.2
2016 OctaCoG alignment: A fast and reliable alternative to iterative alignment schemes
Andreas Beyer, Yu Liu 0075, Susanne Krömker
FUSION1
2014 Virtual set-top box in the cloud: Enabling interactive third party applications
abstract
The dramatic growth of mobile devices has led to a significant change in the TV industry. The trend to switch to the cloud is unstoppable, since it promises cost-savings and new ways of generating revenue. One big challenge is still to manage the virtualization of the full functionality of the set-top box in the cloud, so that it can be accessed from anywhere from any device. In this paper we present a platform-as-a-service media solution to addresses this challenge. The focus is to design and implement proper interfaces to enable interactive third-party applications to extend the capability of the virtual set-top box in the cloud. We validate the proposed APIs with some example applications and further discuss its theoretical and practical scalability. To the best of our knowledge, this is the first concrete work to discuss the design and implementation issues of application interfaces for virtual set-top box in the cloud.
Jörn Franke, Andreas Beyer
NOMS2
2014 Coiled-Coil Proteins Facilitated the Functional Expansion of the Centrosome
abstract
Repurposing existing proteins for new cellular functions is recognized as a main mechanism of evolutionary innovation, but its role in organelle evolution is unclear. Here, we explore the mechanisms that led to the evolution of the centrosome, an ancestral eukaryotic organelle that expanded its functional repertoire through the course of evolution. We developed a refined sequence alignment technique that is more sensitive to coiled coil proteins, which are abundant in the centrosome. For proteins with high coiled-coil content, our algorithm identified 17% more reciprocal best hits than BLAST. Analyzing 108 eukaryotic genomes, we traced the evolutionary history of centrosome proteins. In order to assess how these proteins formed the centrosome and adopted new functions, we computationally emulated evolution by iteratively removing the most recently evolved proteins from the centrosomal protein interaction network. Coiled-coil proteins that first appeared in the animal-fungi ancestor act as scaffolds and recruit ancestral eukaryotic proteins such as kinases and phosphatases to the centrosome. This process created a signaling hub that is crucial for multicellular development. Our results demonstrate how ancient proteins can be co-opted to different cellular localizations, thereby becoming involved in novel functions.
Michael Kuhn 0004, Anthony A. Hyman, Andreas Beyer
PLoS Comput. Biol.3
2014 Revealing Molecular Mechanisms by Integrating High-Dimensional Functional Screens with Protein Interaction Data
abstract
Functional genomics screens using multi-parametric assays are powerful approaches for identifying genes involved in particular cellular processes. However, they suffer from problems like noise, and often provide little insight into molecular mechanisms. A bottleneck for addressing these issues is the lack of computational methods for the systematic integration of multi-parametric phenotypic datasets with molecular interactions. Here, we present Integrative Multi Profile Analysis of Cellular Traits (IMPACT). The main goal of IMPACT is to identify the most consistent phenotypic profile among interacting genes. This approach utilizes two types of external information: sets of related genes (IMPACT-sets) and network information (IMPACT-modules). Based on the notion that interacting genes are more likely to be involved in similar functions than non-interacting genes, this data is used as a prior to inform the filtering of phenotypic profiles that are similar among interacting genes. IMPACT-sets selects the most frequent profile among a set of related genes. IMPACT-modules identifies sub-networks containing genes with similar phenotype profiles. The statistical significance of these selections is subsequently quantified via permutations of the data. IMPACT (1) handles multiple profiles per gene, (2) rescues genes with weak phenotypes and (3) accounts for multiple biases e.g. caused by the network topology. Application to a genome-wide RNAi screen on endocytosis showed that IMPACT improved the recovery of known endocytosis-related genes, decreased off-target effects, and detected consistent phenotypes. Those findings were confirmed by rescreening 468 genes. Additionally we validated an unexpected influence of the IGF-receptor on EGF-endocytosis. IMPACT facilitates the selection of high-quality phenotypic profiles using different types of independent information, thereby supporting the molecular interpretation of functional screens.
Angela Simeone, Giovanni Marsico, Claudio Collinet, Thierry Galvez, Yannis Kalaidzidis, Marino Zerial, Andreas Beyer
PLoS Comput. Biol.7
2013 Dynamic resource allocation for cloud-based media processing
abstract
As an economic and scalable solution of providing interactive and adaptive media content across different devices, cloud-based media processing has recently attracted lots of attention from both academic and industry. Within a media cloud, a large number of media processing tasks will be dynamically spawn to run in parallel and then share resource with each other in the cloud. In such a dynamic and shared environment, how to appropriately provision cloud resource to different tasks with regards to both system efficiency and quality of service remains a challenging issue. Existing resource allocation algorithms consider generic task and only focus on maximizing system efficiency, but failed to meet the QoS requirement of media tasks. In this paper, we investigate the relationship between the properities of media tasks and their resource comsumption and accordingly propose a dynamic resource allocation solution. Our solution leverages machine learning technique to predict resource requirement and survival functions to prevent QoS degradation.
Krisantus Sembiring, Andreas Beyer
NOSSDAV2
2013 Assessing Computational Methods for Transcription Factor Target Gene Identification Based on ChIP-seq Data
abstract
Chromatin immunoprecipitation coupled with deep sequencing (ChIP-seq) has great potential for elucidating transcriptional networks, by measuring genome-wide binding of transcription factors (TFs) at high resolution. Despite the precision of these experiments, identification of genes directly regulated by a TF (target genes) is not trivial. Numerous target gene scoring methods have been used in the past. However, their suitability for the task and their performance remain unclear, because a thorough comparative assessment of these methods is still lacking. Here we present a systematic evaluation of computational methods for defining TF targets based on ChIP-seq data. We validated predictions based on 68 ChIP-seq studies using a wide range of genomic expression data and functional information. We demonstrate that peak-to-gene assignment is the most crucial step for correct target gene prediction and propose a parameter-free method performing most consistently across the evaluation tests.
Weronika Sikora-Wohlfeld, Marit Ackermann, Eleni G. Christodoulou, Singaravelu Kalaimathy, Andreas Beyer
PLoS Comput. Biol.5
2012 Topology of functional networks predicts physical binding of proteins
abstract
MOTIVATION: It has been recognized that the topology of molecular networks provides information about the certainty and nature of individual interactions. Thus, network motifs have been used for predicting missing links in biological networks and for removing false positives. However, various different measures can be inferred from the structure of a given network and their predictive power varies depending on the task at hand. RESULTS: Herein, we present a systematic assessment of seven different network features extracted from the topology of functional genetic networks and we quantify their ability to classify interactions into different types of physical protein associations. Using machine learning, we combine features based on network topology with non-network features and compare their importance of the classification of interactions. We demonstrate the utility of network features based on human and budding yeast networks; we show that network features can distinguish different sub-types of physical protein associations and we apply the framework to fission yeast, which has a much sparser known physical interactome than the other two species. Our analysis shows that network features are at least as predictive for the tasks we tested as non-network features. However, feature importance varies between species owing to different topological characteristics of the networks. The application to fission yeast shows that small maps of physical interactomes can be extended based on functional networks, which are often more readily available. AVAILABILITY AND IMPLEMENTATION: The R-code for computing the network features is available from www.cellularnetworks.org
Ömer Sinan Saraç, Vera Pancaldi, Jürg Bähler, Andreas Beyer
Bioinform.4
2009 Predicting functionality of protein-DNA interactions by integrating diverse evidence
abstract
Chromatin immunoprecipitation (ChIP-chip) experiments enable capturing physical interactions between regulatory proteins and DNA in vivo. However, measurement of chromatin binding alone is not sufficient to detect regulatory interactions. A detected binding event may not be biologically relevant, or a known regulatory interaction might not be observed under the growth conditions tested so far. To correctly identify physical interactions between transcription factors (TFs) and genes and to determine their regulatory implications under various experimental conditions, we integrated ChIP-chip data with motif binding sites, nucleosome occupancy and mRNA expression datasets within a probabilistic framework. This framework was specifically tailored for the identification of functional and non-functional DNA binding events. Using this, we estimate that only 50% of condition-specific protein-DNA binding in budding yeast is functional. We further investigated the molecular factors determining the functionality of protein-DNA interactions under diverse growth conditions. Our analysis suggests that the functionality of binding is highly condition-specific and highly dependent on the presence of specific cofactors. Hence, the joint analysis of both, functional and non-functional DNA binding, may lend important new insights into transcriptional regulation.
Duygu Ucar, Andreas Beyer, Srinivasan Parthasarathy 0001, Christopher T. Workman
Bioinform.2
2008 Parallel hardware objects for dynamically partial reconfiguration
abstract
Many of today’s software-to-hardware compiler projects try to find dataflow parallelism in a sequential program description and use it to generate parallel running hardware components. In this paper we present a new possibility to do a parallel description based on the combination of object-oriented programming and dynamically partial reconfiguration. Our compiler translates software objects directly to Hardware Objects, which are running in parallel and can be instantiated and removed dynamically. Furthermore, we focus on parallel inter object communication which allows the Hardware Objects to communicate in parallel.
Norbert Abel, Frederik Grüll, Nick Meier, Andreas Beyer, Udo Kebschull
FPL4
2007 DASS: efficient discovery and p-value calculation of substructures in unordered data
abstract
MOTIVATION: Pattern identification in biological sequence data is one of the main objectives of bioinformatics research. However, few methods are available for detecting patterns (substructures) in unordered datasets. Data mining algorithms mainly developed outside the realm of bioinformatics have been adapted for that purpose, but typically do not determine the statistical significance of the identified patterns. Moreover, these algorithms do not exploit the often modular structure of biological data. RESULTS: We present the algorithm DASS (Discovery of All Significant Substructures) that first identifies all substructures in unordered data (DASS(Sub)) in a manner that is especially efficient for modular data. In addition, DASS calculates the statistical significance of the identified substructures, for sets with at most one element of each type (DASS(P(set))), or for sets with multiple occurrence of elements (DASS(P(mset))). The power and versatility of DASS is demonstrated by four examples: combinations of protein domains in multi-domain proteins, combinations of proteins in protein complexes (protein subcomplexes), combinations of transcription factor target sites in promoter regions and evolutionarily conserved protein interaction subnetworks. AVAILABILITY: The program code and additional data are available at http://www.fli-leibniz.de/tsb/DASS
Jens Hollunder, Maik Friedel, Andreas Beyer, Christopher T. Workman, Thomas Wilhelm 0003
Bioinform.3
2007 Posttranscriptional Expression Regulation: What Determines Translation Rates?
abstract
Recent analyses indicate that differences in protein concentrations are only 20%-40% attributable to variable mRNA levels, underlining the importance of posttranscriptional regulation. Generally, protein concentrations depend on the translation rate (which is proportional to the translational activity, TA) and the degradation rate. By integrating 12 publicly available large-scale datasets and additional database information of the yeast Saccharomyces cerevisiae, we systematically analyzed five factors contributing to TA: mRNA concentration, ribosome density, ribosome occupancy, the codon adaptation index, and a newly developed "tRNA adaptation index." Our analysis of the functional relationship between the TA and measured protein concentrations suggests that the TA follows Michaelis-Menten kinetics. The calculated TA, together with measured protein concentrations, allowed us to estimate degradation rates for 4,125 proteins under standard conditions. A significant correlation to recently published degradation rates supports our approach. Moreover, based on a newly developed scoring system, we identified and analyzed genes subjected to the posttranscriptional regulation mechanism, translation on demand. Next we applied these findings to publicly available data of protein and mRNA concentrations under four stress conditions. The integration of these measurements allowed us to compare the condition-specific responses at the posttranscriptional level. Our analysis of all 62 proteins that have been measured under all four conditions revealed proteins with very specific posttranscriptional stress response, in contrast to more generic responders, which were nonspecifically regulated under several conditions. The concept of specific and generic responders is known for transcriptional regulation. Here we show that it also holds true at the posttranscriptional level.
Regina Brockmann, Andreas Beyer, Jürgen J. Heinisch, Thomas Wilhelm 0003
PLoS Comput. Biol.2
2006 Integrated Assessment and Prediction of Transcription Factor Binding
abstract
Systematic chromatin immunoprecipitation (chIP-chip) experiments have become a central technique for mapping transcriptional interactions in model organisms and humans. However, measurement of chromatin binding does not necessarily imply regulation, and binding may be difficult to detect if it is condition or cofactor dependent. To address these challenges, we present an approach for reliably assigning transcription factors (TFs) to target genes that integrates many lines of direct and indirect evidence into a single probabilistic model. Using this approach, we analyze publicly available chIP-chip binding profiles measured for yeast TFs in standard conditions, showing that our model interprets these data with significantly higher accuracy than previous methods. Pooling the high-confidence interactions reveals a large network containing 363 significant sets of factors (TF modules) that cooperate to regulate common target genes. In addition, the method predicts 980 novel binding interactions with high confidence that are likely to occur in so-far untested conditions. Indeed, using new chIP-chip experiments we show that predicted interactions for the factors Rpn4p and Pdr1p are observed only after treatment of cells with methyl-methanesulfonate, a DNA-damaging agent. We outline the first approach for consistently integrating all available evidences for TF-target interactions and we comprehensively identify the resulting TF module hierarchy. Prioritizing experimental conditions for each factor will be especially important as increasing numbers of chIP-chip assays are performed in complex organisms such as humans, for which "standard conditions" are ill defined.
Andreas Beyer, Christopher T. Workman, Jens Hollunder, Dörte Radke, Ulrich Möller, Thomas Wilhelm 0003, Trey Ideker
PLoS Comput. Biol.1
2005 Dynamic simulation of protein complex formation on a genomic scale
abstract
MOTIVATION: One of the central questions in the post-genomic era is the understanding of protein-protein interactions and of protein complex formation. It has been observed that protein complex size distributions of the yeast Saccharomyces cerevisiae decay exponentially. The shape of these size distributions reflects mechanisms of protein complex association and dissociation. RESULTS: We present the most simple dynamic model that is able to reproduce the observed protein complex size distribution for yeast. This protein association-dissociation model (PAD-model) simulates the dynamics of protein complex formation on a genomic scale for about 50 million protein molecules. By ruling out different model variants it is possible to elucidate fundamental features of the protein complex dynamics, e.g. complex association is independent of complex size. In addition, the PAD-model provides information about the complexity of the yeast proteome and it gives an idea of how many complexes could not be identified during the measurements. AVAILABILITY: All programs used for this publication are available on request from the authors. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary information about the model and its interpretation can be downloaded from http://www.imb-jena.de/tsb/pad.
Andreas Beyer, Thomas Wilhelm 0003
Bioinform.1