The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
On schemes of combinatorial transcription logic
Open accessAbstract
Cells receive a wide variety of cellular and environmental signals, which are often processed combinatorially to generate specific genetic responses. Here we explore theoretically the potentials and limitations of combinatorial signal integration at the level of cis-regulatory transcription control. Our analysis suggests that many complex transcription-control functions of the type encountered in higher eukaryotes are already implementable within the much simpler bacterial transcription system. Using a quantitative model of bacterial transcription and invoking only specific protein–DNA interaction and weak glue-like interaction between regulatory proteins, we show explicit schemes to implement regulatory logic functions of increasing complexity by appropriately selecting the strengths and arranging the relative positions of the relevant protein-binding DNA sequences in the cis-regulatory region. The architectures that emerge are naturally modular and evolvable. Our results suggest that the transcription regulatory apparatus is a “programmable” computing machine, belonging formally to the class of Boltzmann machines. Crucial to our results is the ability to regulate gene expression at a distance. In bacteria, this can be achieved for isolated genes via DNA looping controlled by the dimerization of DNA-bound proteins. However, if adopted extensively in the genome, long-distance interaction can cause unintentional intergenic cross talk, a detrimental side effect difficult to overcome by the known bacterial transcription-regulation systems. This may be a key factor limiting the genome-wide adoption of complex transcription control in bacteria. Implications of our findings for combinatorial transcription control in eukaryotes are discussed.
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.
Integrity signals
Registry
Cites
Statistics
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.
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
The Origins of Order: Self-Organization and Selection in Evolution
Kauffman, S. A. (1993) · doi:10.1093/oso/9780195079517.001.0001 · Cited by 7,855
Stochastic Gene Expression in a Single Cell
Elowitz, M. B., Levine, A. J., Siggia, E. D., & Swain, P. S. (2002) · Science · doi:10.1126/science.1070919 · Cited by 5,441
Transcriptional Regulatory Networks in Saccharomyces cerevisiae
Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. T., Thompson, C. M., Simon, I., et al. (2002) · Science · doi:10.1126/science.1075090 · Cited by 2,956
A genomic regulatory network for development
Davidson, E. H., Rast, J. P., Oliveri, P., Ransick, A., Calestani, C., Yuh, C.-H., Minokawa, T., Amore, G., Hinman, V., Arenas-Mena, C., et al. (2002) · Science · doi:10.1126/science.1069883 · Cited by 1,567
Transcriptional activation by recruitment
Ptashne, M., & Gann, A. (1997) · Nature · doi:10.1038/386569a0 · Cited by 1,158
Regulation of Ets function by protein–protein interactions
Li, R., Pei, H., & Watson, D. K. (2000) · Oncogene · doi:10.1038/sj.onc.1204035 · Cited by 229
The eve stripe 2 enhancer employs multiple modes of transcriptional synergy
Arnosti, D. N., Barolo, S., Levine, M., & Small, S. (1996) · Development · doi:10.1242/dev.122.1.205 · Cited by 226
Cited by
Network motifs: theory and experimental approaches
Alon, U. (2007) · Nature Reviews Genetics · doi:10.1038/nrg2102 · Cited by 3,279
Structure and function of the feed-forward loop network motif
Mangan, S., & Alon, U. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2133841100 · Cited by 1,827
Genetic circuit design automation
Nielsen, A. A. K., Der, B. S., Shin, J., Vaidyanathan, P., Paralanov, V., Strychalski, E. A., Ross, D., Densmore, D., & Voigt, C. A. (2016) · Science · doi:10.1126/science.aac7341 · Cited by 1,020
RNA regulation: A new genetics?
Mattick, J. S. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1321 · Cited by 765
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Hamady, M., Peden, E., Knight, R., & Singh, R. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-1 · Cited by 543
Metadata
- Authors
- Buchler, N. E., Gerland, U., & Hwa, T.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2003-04-17
- Volume
- 100
- Issue
- 9
- Pages
- 5136-5141
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2046355391
- Cited by
- 680
- References
- 7
- FWCI
- 9.44
- Type
- journal article
- Language
- en
- Open access
- green
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: On schemes of combinatorial transcription logic. https://app.cochat.ai/papers/10.1073/pnas.0930314100
- The paper
- Buchler, N. E., Gerland, U., & Hwa, T. (2003). On schemes of combinatorial transcription logic. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.0930314100
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.