CoChat

Designing instructable networks using synthetic replicators

Kassianidis, Eleftherios, Pearson, Russell J., Wood, Evan A., Philp, Douglas · 2010 · Faraday Discuss.
Cited by 28

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

Abstract

Synthetic chemistry has focused on the creation of discrete chemical entities through the programmed application of a series of chemical reactions, usually in a linear cascade. By contrast, systems chemistry demands the presence of a mixture of compounds and it is the interactions between these multiple components that are a necessity for the emergence of properties at a whole system level. A key component of systems chemistry will be the development of synthetic machinery that is capable of directing its own synthesis and co-operating with other similar systems to create an organized hierarchy or network. Central to this goal is the development of networks of replicating templates. Although the design and implementation of replicating templates which operate by either autocatalytic or crosscatalytic mechanisms is becoming routine, the incorporation of these templates into networks remains challenging. An initial experimental attempt to create such a network of replicators using a set of replicators previously characterized individually results in an uninstructable system. The failure of this network to respond to template inputs in a programmed manner is rationalized using kinetic simulations and the design criteria necessary to effect a replication network that is capable of responding to template inputs in a programmed way are deduced using kinetic simulations.

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.1039/b915061g

Cites

9 of 9 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

Cited by

See all 28

Metadata

Authors
Kassianidis, E., Pearson, R. J., Wood, E. A., & Philp, D.
Venue
Faraday Discuss.
Published
2010
Volume
145
Pages
235-254
ISSN
  • 1359-6640 (ISSN-L)
  • 1364-5498
OpenAlex
W2099241884
Cited by
28
References
9
FWCI
1.37
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

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.