Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 82Gene Regulatory Network AnalysisSingle-cell and spatial transcriptomicsMicrobial Metabolic Engineering and Bioproduction

The DOI matches its Crossref record; 51 of the 53 references it cites were found in a registry or an index.

BTR: training asynchronous Boolean models using single-cell expression data

Open access

Abstract

Background: Rapid technological innovation for the generation of single-cell genomics data presents new challenges and opportunities for bioinformatics analysis. One such area lies in the development of new ways to train gene regulatory networks. The use of single-cell expression profiling technique allows the profiling of the expression states of hundreds of cells, but these expression states are typically noisier due to the presence of technical artefacts such as drop-outs. While many algorithms exist to infer a gene regulatory network, very few of them are able to harness the extra expression states present in single-cell expression data without getting adversely affected by the substantial technical noise present. Results: Here we introduce BTR, an algorithm for training asynchronous Boolean models with single-cell expression data using a novel Boolean state space scoring function. BTR is capable of refining existing Boolean models and reconstructing new Boolean models by improving the match between model prediction and expression data. We demonstrate that the Boolean scoring function performed favourably against the BIC scoring function for Bayesian networks. In addition, we show that BTR outperforms many other network inference algorithms in both bulk and single-cell synthetic expression data. Lastly, we introduce two case studies, in which we use BTR to improve published Boolean models in order to generate potentially new biological insights. Conclusions: BTR provides a novel way to refine or reconstruct Boolean models using single-cell expression data. Boolean model is particularly useful for network reconstruction using single-cell data because it is more robust to the effect of drop-outs. In addition, BTR does not assume any relationship in the expression states among cells, it is useful for reconstructing a gene regulatory network with as few assumptions as possible. Given the simplicity of Boolean models and the rapid adoption of single-cell genomics by biologists, BTR has the potential to make an impact across many fields of biomedical research.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1186/s12859-016-1235-y

Cites

51 of 51 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Boolean model, asynchronous simulation and the framework underlying BTR. a A Boolean model can be expressed graphically in terms of nodes and edges, as well as in tabular form in terms of update functions. Note that the small black node refers to AND interaction. b The asynchronous update scheme is best explained with the use of a graph representation of state space, in which each connected state differs in only one node. Starting from the initial state s 1 = {0, 0, 1, 1} and evaluated using the update functions in (a), asynchronous simulation produces a model state space with 15 states. The initial state is shown in red node, while the final steady state is shown in pink node. c The framework underlying BTR. A Boolean model can be simulated to give a model state space, while a single-cell expression data can be preprocessed to give a data state space. Boolean state space scoring function can then calculate the distance score between the model and data state spaces. Lastly, BTR uses the computed distance score to guide the improvement of the Boolean model through an optimisation process that minimises the distance between model and data state spaces
Fig. 1 Boolean model, asynchronous simulation and the framework underlying BTR. a A Boolean model can be expressed graphically in terms of nodes and edges, as well as in tabular form in terms of update functions. Note that the small black node refers to AND interaction. b The asynchronous update scheme is best explained with the use of a graph representation of state space, in which each connected state differs in only one node. Starting from the initial state s 1 = {0, 0, 1, 1} and evaluated using the update functions in (a), asynchronous simulation produces a model state space with 15 states. The initial state is shown in red node, while the final steady state is shown in pink node. c The framework underlying BTR. A Boolean model can be simulated to give a model state space, while a single-cell expression data can be preprocessed to give a data state space. Boolean state space scoring function can then calculate the distance score between the model and data state spaces. Lastly, BTR uses the computed distance score to guide the improvement of the Boolean model through an optimisation process that minimises the distance between model and data state spacesCC BY · PubMed Central
Fig. 2 BSS scoring function compares favourably with BIC scoring function on acyclic networks. a Acyclic networks generated from GeneNetWeaver that are designated as the true acyclic networks. Each node corresponds to a gene. Black edges indicate activation interactions, while red edges indicate inhibition interactions. Mean distance scores computed using b BIC scoring function and c BSS scoring function for modified networks that are increasingly different from the true network in terms of edges using zero-inflated synthetic expression data. The modified networks contain from two edges up to forty different edges when compared with the true network. Each data point is the mean distance score of 100 different random modified networks that contain the same number of different edges with respect to the true network. The error bar is the standard error of the mean
Fig. 2 BSS scoring function compares favourably with BIC scoring function on acyclic networks. a Acyclic networks generated from GeneNetWeaver that are designated as the true acyclic networks. Each node corresponds to a gene. Black edges indicate activation interactions, while red edges indicate inhibition interactions. Mean distance scores computed using b BIC scoring function and c BSS scoring function for modified networks that are increasingly different from the true network in terms of edges using zero-inflated synthetic expression data. The modified networks contain from two edges up to forty different edges when compared with the true network. Each data point is the mean distance score of 100 different random modified networks that contain the same number of different edges with respect to the true network. The error bar is the standard error of the meanCC BY · PubMed Central
Fig. 3 BSS scoring function is able to calculate distance scores for cyclic networks. a Cyclic networks generated from GeneNetWeaver that are designated as the true cyclic networks. Each node corresponds to a gene. Black edges indicate activation interactions, while red edges indicate inhibition interactions. b Mean distance scores computed using BSS scoring function for modified networks that are increasingly different from the true network in terms of edges using zero-inflated synthetic expression data. The modified networks contain from two edges up to forty different edges when compared with the true network. Each data point is the mean distance score of 100 different random modified networks that contain the same number of different edges with respect to the true network. The error bar is the standard error of the mean
Fig. 3 BSS scoring function is able to calculate distance scores for cyclic networks. a Cyclic networks generated from GeneNetWeaver that are designated as the true cyclic networks. Each node corresponds to a gene. Black edges indicate activation interactions, while red edges indicate inhibition interactions. b Mean distance scores computed using BSS scoring function for modified networks that are increasingly different from the true network in terms of edges using zero-inflated synthetic expression data. The modified networks contain from two edges up to forty different edges when compared with the true network. Each data point is the mean distance score of 100 different random modified networks that contain the same number of different edges with respect to the true network. The error bar is the standard error of the meanCC BY · PubMed Central
Fig. 4 Summary of BIC and BSS scoring functions. Mean scores have been calculated across all networks (five acyclic networks and five cyclic networks) for BIC and BSS scoring functions calculated using zero-inflated synthetic expression data. All scores have been standardised for comparison purpose, such that the scores range from 0 to 1
Fig. 4 Summary of BIC and BSS scoring functions. Mean scores have been calculated across all networks (five acyclic networks and five cyclic networks) for BIC and BSS scoring functions calculated using zero-inflated synthetic expression data. All scores have been standardised for comparison purpose, such that the scores range from 0 to 1CC BY · PubMed Central
Fig. 5 BTR outperforms other network inference algorithms. Mean F-scores of network inference algorithms inferred using a non zero-inflated synthetic data and b zero-inflated synthetic data. Ten true synthetic networks (Five each for acyclic and cyclic networks) were used in the assessment of these network inference algorithms. Plots titled ‘Both’ show the combined results of acyclic and cyclic network inference. The error bar is the standard error of the mean
Fig. 5 BTR outperforms other network inference algorithms. Mean F-scores of network inference algorithms inferred using a non zero-inflated synthetic data and b zero-inflated synthetic data. Ten true synthetic networks (Five each for acyclic and cyclic networks) were used in the assessment of these network inference algorithms. Plots titled ‘Both’ show the combined results of acyclic and cyclic network inference. The error bar is the standard error of the meanCC BY · PubMed Central
Fig. 6 BTR predicts gene interactions by training the Bonzanni and Krumsiek Boolean models. a Original Bonzanni model. b Trained Bonzanni model. c Original Krumsiek model. d Trained Krumsiek model. Round orange nodes indicate genes, square black nodes indicate AND gates that combine the two input gene interactions. Blue edges indicate activation interactions, red edges indicate inhibition interactions. Dashed lines in the original models indicate edges that are present in the original models, but are removed in the trained models. Dashed lines in the trained models indicate edges that are added to the trained models and are not present in the original models
Fig. 6 BTR predicts gene interactions by training the Bonzanni and Krumsiek Boolean models. a Original Bonzanni model. b Trained Bonzanni model. c Original Krumsiek model. d Trained Krumsiek model. Round orange nodes indicate genes, square black nodes indicate AND gates that combine the two input gene interactions. Blue edges indicate activation interactions, red edges indicate inhibition interactions. Dashed lines in the original models indicate edges that are present in the original models, but are removed in the trained models. Dashed lines in the trained models indicate edges that are added to the trained models and are not present in the original modelsCC BY · PubMed Central
Fig. 7 State spaces for the trained Bonzanni and Krumsiek Boolean models. a State space of trained Bonzanni model. b State space of trained Krumsiek model. Blue nodes represent transitional model states, while pink nodes represent steady model states. Each arrow indicates transitions among states
Fig. 7 State spaces for the trained Bonzanni and Krumsiek Boolean models. a State space of trained Bonzanni model. b State space of trained Krumsiek model. Blue nodes represent transitional model states, while pink nodes represent steady model states. Each arrow indicates transitions among statesCC BY · PubMed Central
Fig. 8 Steady states for the Bonzanni and Krumsiek Boolean models. a Steady states of Bonzanni models. Both original and trained models contain two point steady states and one cyclic steady state each. b Steady states of Krumsiek models. Original model contains six point steady states, while trained model contains nine point steady states. Black box indicates expression is absent (i.e. 0), red box indicates expression is present (i.e. 1), purple box indicates expression can be absent or present (i.e. 0 or 1). White box is used to indicate that the additional genes included in trained Krumsiek model that are not present in the original Krumsiek model
Fig. 8 Steady states for the Bonzanni and Krumsiek Boolean models. a Steady states of Bonzanni models. Both original and trained models contain two point steady states and one cyclic steady state each. b Steady states of Krumsiek models. Original model contains six point steady states, while trained model contains nine point steady states. Black box indicates expression is absent (i.e. 0), red box indicates expression is present (i.e. 1), purple box indicates expression can be absent or present (i.e. 0 or 1). White box is used to indicate that the additional genes included in trained Krumsiek model that are not present in the original Krumsiek modelCC BY · PubMed Central
Fig. 9 Pseudocode of the search algorithm in BTR
Fig. 9 Pseudocode of the search algorithm in BTRCC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 53 references

Cited by

See all 82

Metadata

Authors
Lim, C. Y., Wang, H., Woodhouse, S., Piterman, N., Wernisch, L., Fisher, J., & Göttgens, B.
Affiliations
  • Wellcome/MRC Cambridge Stem Cell Institute (GB)
  • University of Leicester (GB)
  • MRC Biostatistics Unit (GB)
  • University of Cambridge (GB)
Corresponding author
Göttgens, Berthold
Venue
BMC Bioinformatics
Published
2016-09-06
Volume
17
Issue
1
Pages
355-355
ISSN
1471-2105 (ISSN-L)
OpenAlex
W2460857593
Cited by
81
References
53
Citations by year
2026: 3 · 2025: 9 · 2024: 4 · 2023: 11 · 2022: 8 · 2021: 15 · 2020: 9 · 2019: 7 · 2018: 7 · 2017: 7 · 2016: 1
FWCI
3.81
Type
journal article
Language
en
Open access
Licence
Locations
  • BMC Bioinformatics (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • Figshare (submittedVersion, cc-by)
  • Leicester Research Archive (University of Leicester) (submittedVersion, cc-by)
  • Queen Mary Research Online (Queen Mary University of London) (submittedVersion, cc-by)
  • Apollo (University of Cambridge) (submittedVersion, cc-by)
  • Apollo (cc-by)
Funders
  • Bloodwise (12029)
  • Biotechnology and Biological Sciences Research Council (BB/I00050X/1)
  • Cambridge Institute for Medical Research, University of Cambridge (RP-PG-0310-1002)
  • Microsoft Research (2012-023)
  • Wellcome Trust (100140/Z/12/Z; 097922/Z/11/Z)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Gene Regulatory Network Analysis
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Single-cell and spatial transcriptomics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Microbial Metabolic Engineering and Bioproduction
Keywords
gene regulatory networks, single-cell gene expression
MeSH terms
Algorithms, Animals, Bayes Theorem, Cells, Humans, Models, Genetic, Computational Biology, Gene Expression Profiling, Gene Regulatory Networks, Single-Cell Analysis

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: BTR: training asynchronous Boolean models using single-cell expression data. https://app.cochat.ai/papers/10.1186/s12859-016-1235-y
The paper
Lim, C. Y., Wang, H., Woodhouse, S., Piterman, N., Wernisch, L., Fisher, J., & Göttgens, B. (2016). BTR: training asynchronous Boolean models using single-cell expression data. BMC Bioinformatics. https://doi.org/10.1186/s12859-016-1235-y

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.