CoChat

Systems Chemistry: Logic Gates, Arithmetic Units, and Network Motifs in Small Networks

Wagner, Nathaniel, Ashkenasy, Gonen · 2009 · Chemistry – A European Journal
Cited by 110

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

Abstract

How much “systems chemistry” really exists within small networks? To answer this question, the authors study tertiary networks that facilitate molecular replication through all Boolean logic operations and show how such gates can be wired together to perform computational and feed‐forward based network motifs (see graphic).magnified image A mixture of molecules can be regarded as a network if all the molecular components participate in some kind of interaction with other molecules—either physical or functional interactions. Template‐assisted ligation reactions that direct replication processes can serve as the functional elements that connect two members of a chemical network. In such a process, the template does not necessarily catalyze its own formation, but rather the formation of another molecule, which in turn can operate as a template for reactions within the network medium. It was postulated that even networks made up of small numbers of molecules possess a wealth of molecular information sufficient to perform rather complex behavior. To probe this assumption, we have constructed virtual arrays consisting of three replicating molecules, in which dimer templates are capable of catalyzing reactants to form additional templates. By using realistic parameters from peptides or DNA replication experiments, we simulate the construction of various functional motifs within the networks. Specifically, we have designed and implemented each of the three‐element Boolean logic gates, and show how these networks are assembled from four basic “building blocks”. We also show how the catalytic pathways can be wired together to perform more complex arithmetic units and network motifs, such as the half adder and half subtractor computational modules, and the coherent feed‐forward loop network motifs under different sets of parameters. As in previous studies of chemical networks, some of the systems described display behavior that would be difficult to predict without the numerical simulations. Furthermore, the simulations reveal trends and characteristics that should be useful as “recipes” for future design of experimental functional motifs and for potential integration into modular circuits and molecular computation devices.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1002/chem.200801850

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

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 19 references

Cited by

See all 110

Metadata

Authors
Wagner, N., & Ashkenasy, G.
Venue
Chemistry – A European Journal
Publisher
Wiley
Published
2009-01-26
Volume
15
Issue
7
Pages
1765-1775
ISSN
  • 0947-6539 (ISSN-L)
  • 1521-3765
OpenAlex
W1980532967
Cited by
110
References
19
FWCI
4.71
Type
journal article
Language
en
Open access
closed

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: Systems Chemistry: Logic Gates, Arithmetic Units, and Network Motifs in Small Networks. https://app.cochat.ai/papers/10.1002/chem.200801850
The paper
Wagner, N., & Ashkenasy, G. (2009). Systems Chemistry: Logic Gates, Arithmetic Units, and Network Motifs in Small Networks. Chemistry – A European Journal. https://doi.org/10.1002/chem.200801850

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.