Evidence map›Paper›PMID 31029103›Full record

ArticleBMC bioinformatics2019

Adapting machine-learning algorithms to design gene circuits.

Tom W Hiscock

Abstract read
In one paragraph

Article in BMC bioinformatics, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 21 papers.

0numbers the graph read from it
0cells of the map it votes in
21citing 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

21 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Review
  10. Review on Advancement of AI in Synthetic Biology.Methods in molecular biology (Clifton, N.J.) · 2025
    Review
  11. Article
  12. Article
  13. Article
  14. Article
  15. Review
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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

1 author.

Tom W HiscockCancer Research UK, Cambridge Institute, Li Ka Shing Centre, Robinson Way, Cambridge, CB2 0RE, UK. twh27@cam.ac.uk.ORCID http://orcid.org/0000-0002-0319-8679

Funding

European Molecular Biology Organization EMBO ALTF 606-2018
6 · The paper itself

Abstract

backgroundGene circuits are important in many aspects of biology, and perform a wide variety of different functions. For example, some circuits oscillate (e.g. the cell cycle), some are bistable (e.g. as cells differentiate), some respond sharply to environmental signals (e.g. ultrasensitivity), and some pattern multicellular tissues (e.g. Turing's model). Often, one starts from a given circuit, and using simulations, asks what functions it can perform. Here we want to do the opposite: starting from a prescribed function, can we find a circuit that executes this function? Whilst simple in principle, this task is challenging from a computational perspective, since gene circuit models are complex systems with many parameters. In this work, we adapted machine-learning algorithms to significantly accelerate gene circuit discovery.

resultsWe use gradient-descent optimization algorithms from machine learning to rapidly screen and design gene circuits. With this approach, we found that we could rapidly design circuits capable of executing a range of different functions, including those that: (1) recapitulate important in vivo phenomena, such as oscillators, and (2) perform complex tasks for synthetic biology, such as counting noisy biological events.

conclusionsOur computational pipeline will facilitate the systematic study of natural circuits in a range of contexts, and allow the automatic design of circuits for synthetic biology. Our method can be readily applied to biological networks of any type and size, and is provided as an open-source and easy-to-use python module, GeneNet.

Indexed as

AlgorithmsGene Regulatory NetworksMachine LearningSoftwareGene circuitsMachine learningNumerical screens

Identifiers

PMID31029103
PMCPMC6487017

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.