Andreas Tjärnberg

Andreas Tjärnberg

Auto-generated profile, based on publicly available information

Andreas Tjärnberg

Allen Institute, Brain Health, Seattle, WA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
21 February 2022 in Bioinformatics
Verified
Journal Article
Open access
PDF file
CGClaudia Skok Gibbs
Claudia Skok Gibbs
CJChristopher A Jackson
Christopher A Jackson
GSGiuseppe-Antonio Saldi
Giuseppe-Antonio Saldi
ATAndreas Tjärnberg
Andreas Tjärnberg
ASAashna Shah
Aashna Shah
RBRichard Bonneau
Richard Bonneau
Gene regulatory networks define regulatory relationships between transcription factors and target genes within a biological system, and reconstructing them is essential for understanding cellular growth and function. Methods for inferring and reconstructing networks from genomics data have evolved rapidly over the last decade in response to advances in sequencing technology and machine learning. The scale of data collection has increased dramatically; the largest genome-wide gene expression datasets have grown from thousands of measurements to millions of single cells, and new technologies are on the horizon to increase to tens of millions of cells and above. In this work, we present the Inferelator 3.0, which has been significantly updated to integrate data from distinct cell types to learn context-specific regulatory networks and aggregate them into a shared regulatory network, while retaining the functionality of the previous versions. The Inferelator is able to integrate the largest single-cell datasets and learn cell-type-specific gene regulatory networks. Compared to other network inference methods, the Inferelator learns new and informative Saccharomyces cerevisiae networks from single-cell gene expression data, measured by recovery of a known gold standard. We demonstrate its scaling capabilities by learning networks for multiple distinct neuronal and glial cell types in the developing Mus musculus brain at E18 from a large (1.3 million) single-cell gene expression dataset with paired single-cell chromatin accessibility data. The inferelator software is available on GitHub (https://github.com/flatironinstitute/inferelator) under the MIT license and has been released as python packages with associated documentation (https://inferelator.readthedocs.io/). Supplementary data are available at Bioinformatics online.

12 February 2020 in Nature Communications
Verified
Journal Article
Open access
PDF file
SDSanjiv K. Dwivedi
Sanjiv K. Dwivedi
ATAndreas Tjärnberg
Andreas Tjärnberg
JTJesper Tegner
Jesper Tegner
MGMika Gustafsson
Mika Gustafsson
Disease modules in molecular interaction maps have been useful for characterizing diseases. Yet biological networks, that commonly define such modules are incomplete and biased toward some well-studied disease genes. Here we ask whether disease-relevant modules of genes can be discovered without prior knowledge of a biological network, instead training a deep autoencoder from large transcriptional data. We hypothesize that modules could be discovered within the autoencoder representations. We find a statistically significant enrichment of genome-wide association studies (GWAS) relevant genes in the last layer, and to a successively lesser degree in the middle and first layers respectively. In contrast, we find an opposite gradient where a modular protein–protein interaction signal is strongest in the first layer, but then vanishing smoothly deeper in the network. We conclude that a data-driven discovery approach is sufficient to discover groups of disease-related genes.

21 November 2011 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
AAAndrey Alexeyenko
Andrey Alexeyenko
TSThomas Schmitt
Thomas Schmitt
ATAndreas TjäRnberg
Andreas TjäRnberg
DGDmitri Guala
Dmitri Guala
OFOliver Frings
Oliver Frings
ESErik L. L. Sonnhammer
Erik L. L. Sonnhammer
FunCoup (http://FunCoup.sbc.su.se) is a database that maintains and visualizes global gene/protein networks of functional coupling that have been constructed by Bayesian integration of diverse high-throughput data. FunCoup achieves high coverage by orthology-based integration of data sources from different model organisms and from different platforms. We here present release 2.0 in which the data sources have been updated and the methodology has been refined. It contains a new data type Genetic Interaction, and three new species: chicken, dog and zebra fish. As FunCoup extensively transfers functional coupling information between species, the new input datasets have considerably improved both coverage and quality of the networks. The number of high-confidence network links has increased dramatically. For instance, the human network has more than eight times as many links above confidence 0.5 as the previous release. FunCoup provides facilities for analysing the conservation of subnetworks in multiple species. We here explain how to do comparative interactomics on the FunCoup website.

11 June 2014 in Bioinformatics
Verified
Journal Article
Open access
PDF file
MSMatthew E. Studham
Matthew E. Studham
ATAndreas Tjärnberg
Andreas Tjärnberg
TNTorbjörn E. M. Nordling
Torbjörn E. M. Nordling
SNSven Nelander
Sven Nelander
ESErik L. L. Sonnhammer
Erik L. L. Sonnhammer
Motivation: Gene regulatory network (GRN) inference reveals the influences genes have on one another in cellular regulatory systems. If the experimental data are inadequate for reliable inference of the network, informative priors have been shown to improve the accuracy of inferences. Results: This study explores the potential of undirected, confidence-weighted networks, such as those in functional association databases, as a prior source for GRN inference. Such networks often erroneously indicate symmetric interaction between genes and may contain mostly correlation-based interaction information. Despite these drawbacks, our testing on synthetic datasets indicates that even noisy priors reflect some causal information that can improve GRN inference accuracy. Our analysis on yeast data indicates that using the functional association databases FunCoup and STRING as priors can give a small improvement in GRN inference accuracy with biological data. Contact:matthew.studham@scilifelab.se Supplementary information: Supplementary data are available at Bioinformatics online.

7 January 2021 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
ATAndreas Tjärnberg
Andreas Tjärnberg
OMOmar Mahmood
Omar Mahmood
CJChristopher A. Jackson
Christopher A. Jackson
GSGiuseppe-Antonio Saldi
Giuseppe-Antonio Saldi
KCKyunghyun Cho
Kyunghyun Cho
RBRichard A. Bonneau
Richard A. Bonneau
The analysis of single-cell genomics data presents several statistical challenges, and extensive efforts have been made to produce methods for the analysis of this data that impute missing values, address sampling issues and quantify and correct for noise. In spite of such efforts, no consensus on best practices has been established and all current approaches vary substantially based on the available data and empirical tests. The k-Nearest Neighbor Graph (kNN-G) is often used to infer the identities of, and relationships between, cells and is the basis of many widely used dimensionality-reduction and projection methods. The kNN-G has also been the basis for imputation methods using, e.g., neighbor averaging and graph diffusion. However, due to the lack of an agreed-upon optimal objective function for choosing hyperparameters, these methods tend to oversmooth data, thereby resulting in a loss of information with regard to cell identity and the specific gene-to-gene patterns underlying regulatory mechanisms. In this paper, we investigate the tuning of kNN- and diffusion-based denoising methods with a novel non-stochastic method for optimally preserving biologically relevant informative variance in single-cell data. The framework, Denoising Expression data with a Weighted Affinity Kernel and Self-Supervision (DEWÄKSS), uses a self-supervised technique to tune its parameters. We demonstrate that denoising with optimal parameters selected by our objective function (i) is robust to preprocessing methods using data from established benchmarks, (ii) disentangles cellular identity and maintains robust clusters over dimension-reduction methods, (iii) maintains variance along several expression dimensions, unlike previous heuristic-based methods that tend to oversmooth data variance, and (iv) rarely involves diffusion but rather uses a fixed weighted kNN graph for denoising. Together, these findings provide a new understanding of kNN- and diffusion-based denoising methods. Code and example data for DEWÄKSS is available at https://gitlab.com/Xparx/dewakss/-/tree/Tjarnberg2020branch.

22 October 2014 in Molecular BioSystems
Verified
Journal Article
Closed access
PDF file
ATAndreas Tjärnberg
Andreas Tjärnberg
TNTorbjörn E. M. Nordling
Torbjörn E. M. Nordling
MSMatthew Studham
Matthew Studham
SNSven Nelander
Sven Nelander
ESErik L. L. Sonnhammer
Erik L. L. Sonnhammer
Statistical regularisation methods such as LASSO and related L1 regularised regression methods are commonly used to construct models of gene regulatory networks. Although they can theoretically infer the correct network structure, they have been shown in practice to make errors, i.e. leave out existing links and include non-existing links. We show that L1 regularisation methods typically produce a poor network model when the analysed data are ill-conditioned, i.e. the gene expression data matrix has a high condition number, even if it contains enough information for correct network inference. However, the correct structure of network models can be obtained for informative data, data with such a signal to noise ratio that existing links can be proven to exist, when these methods fail, by using least-squares regression and setting small parameters to zero, or by using robust network inference, a recent method taking the intersection of all non-rejectable models. Since available experimental data sets are generally ill-conditioned, we recommend to check the condition number of the data matrix to avoid this pitfall of L1 regularised inference, and to also consider alternative methods.