Evidence map›Paper›PMID 33137083›Full record

ArticlePLoS computational biology2020

Learning and interpreting the gene regulatory grammar in a deep learning framework.

Ling Chen, John A Capra

Abstract read
In one paragraph

Article in PLoS computational biology, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

13 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Review
  6. Review
  7. Review
  8. Article
  9. Review
  10. Transcriptional enhancers and their communication with gene promoters.Cellular and molecular life sciences : CMLS · 2021
    Review
  11. Article
  12. Review
  13. Learning the Regulatory Code of Gene Expression.Frontiers in molecular biosciences · 2021
    Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Ling ChenDepartment of Biological Sciences, Vanderbilt University, Nashville, TN, United States of America.ORCID 0000-0002-3272-1852
John A CapraDepartment of Biological Sciences, Vanderbilt University, Nashville, TN, United States of America.ORCID 0000-0001-9743-1795

Funding

The Evolution of Gene Regulation and Human DiseaseR35GM127087 · NIGMS · VANDERBILT UNIVERSITY · PI John Anthony Capra · 2018 to 2026
$3.2M
Modeling the Dynamics of Genome-Scale Data Across TreesR01GM115836 · NIGMS · UNIVERSITY OF PITTSBURGH AT PITTSBURGH · PI CAPRA, JOHN ANTHONY, KOSTKA, DENNIS · 2015 to 2017
$1.1M
NIGMS NIH HHS R01 GM115836NIGMS NIH HHS R35 GM127087
6 · The paper itself

Abstract

Deep neural networks (DNNs) have achieved state-of-the-art performance in identifying gene regulatory sequences, but they have provided limited insight into the biology of regulatory elements due to the difficulty of interpreting the complex features they learn. Several models of how combinatorial binding of transcription factors, i.e. the regulatory grammar, drives enhancer activity have been proposed, ranging from the flexible TF billboard model to the stringent enhanceosome model. However, there is limited knowledge of the prevalence of these (or other) sequence architectures across enhancers. Here we perform several hypothesis-driven analyses to explore the ability of DNNs to learn the regulatory grammar of enhancers. We created synthetic datasets based on existing hypotheses about combinatorial transcription factor binding site (TFBS) patterns, including homotypic clusters, heterotypic clusters, and enhanceosomes, from real TF binding motifs from diverse TF families. We then trained deep residual neural networks (ResNets) to model the sequences under a range of scenarios that reflect real-world multi-label regulatory sequence prediction tasks. We developed a gradient-based unsupervised clustering method to extract the patterns learned by the ResNet models. We demonstrated that simulated regulatory grammars are best learned in the penultimate layer of the ResNets, and the proposed method can accurately retrieve the regulatory grammar even when there is heterogeneity in the enhancer categories and a large fraction of TFBS outside of the regulatory grammar. However, we also identify common scenarios where ResNets fail to learn simulated regulatory grammars. Finally, we applied the proposed method to mouse developmental enhancers and were able to identify the components of a known heterotypic TF cluster. Our results provide a framework for interpreting the regulatory rules learned by ResNets, and they demonstrate that the ability and efficiency of ResNets in learning the regulatory grammar depends on the nature of the prediction task.

Indexed as

Deep LearningGene Regulatory NetworksGenes, RegulatorAnimalsBinding SitesComputational BiologyComputer SimulationDatabases, GeneticEnhancer Elements, GeneticMiceModels, GeneticNeural Networks, ComputerTerminology as TopicTranscription FactorsTranscription Factors

Identifiers

PMID33137083
PMCPMC7660921

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.