The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Algorithmic Self-Assembly of DNA Sierpinski Triangles
Open accessAbstract
Algorithms and information, fundamental to technological and biological organization, are also an essential aspect of many elementary physical phenomena, such as molecular self-assembly. Here we report the molecular realization, using two-dimensional self-assembly of DNA tiles, of a cellular automaton whose update rule computes the binary function XOR and thus fabricates a fractal pattern--a Sierpinski triangle--as it grows. To achieve this, abstract tiles were translated into DNA tiles based on double-crossover motifs. Serving as input for the computation, long single-stranded DNA molecules were used to nucleate growth of tiles into algorithmic crystals. For both of two independent molecular realizations, atomic force microscopy revealed recognizable Sierpinski triangles containing 100-200 correct tiles. Error rates during assembly appear to range from 1% to 10%. Although imperfect, the growth of Sierpinski triangles demonstrates all the necessary mechanisms for the molecular implementation of arbitrary cellular automata. This shows that engineered DNA self-assembly can be treated as a Turing-universal biomolecular system, capable of implementing any desired algorithm for computation or construction tasks.
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
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Design and self-assembly of two-dimensional DNA crystals
Winfree, E., Liu, F., Wenzler, L. A., & Seeman, N. C. (1998) · Nature · doi:10.1038/28998 · Cited by 2,857 · cited 13×
“The core sequences for R-00 and S-00 are identical to the A and B tiles from a previous study ( Winfree et al. 1998a ).”
BackgroundMethodResultInfluentialSelf-citationLogical computation using algorithmic self-assembly of DNA triple-crossover molecules
Mao, C., LaBean, T. H., Reif, J. H., & Seeman, N. C. (2000) · Nature · doi:10.1038/35035038 · Cited by 779 · cited 6×
“…et al. 1999; LaBean et al. 2000b); the interactions between these tiles can be programmed by sequence-specific hybridization (Winfree et al. 1998a; Mao et al. 2000); cooperative binding of multiple domains ensures specificity—the right tile attaches in the right place (Winfree et al. 1998b; Mao…”
BackgroundInfluential
Cited by
Seeman, N. C., & Sleiman, H. F. (2017) · Nature Reviews Materials · doi:10.1038/natrevmats.2017.68 · Cited by 1,875
Dynamic DNA nanotechnology using strand-displacement reactions
Zhang, D. Y., & Seelig, G. (2011) · Nature Chemistry · doi:10.1038/nchem.957 · Cited by 1,785
Challenges and opportunities for structural DNA nanotechnology
Pinheiro, A. V., Han, D., Shih, W. M., & Yan, H. (2011) · Nature Nanotechnology · doi:10.1038/nnano.2011.187 · Cited by 1,292
Seeman, N. C. (2010) · Annual Review of Biochemistry · doi:10.1146/annurev-biochem-060308-102244 · Cited by 992
Complex shapes self-assembled from single-stranded DNA tiles
Wei, B., Dai, M., & Yin, P. (2012) · Nature · doi:10.1038/nature11075 · Cited by 989
Metadata
- Authors
- Rothemund, P. W. K., Papadakis, N., & Winfree, E.
- Venue
- PLoS Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2004-12-07
- Volume
- 2
- Issue
- 12
- Pages
- e424
- ISSN
- 1544-9173 (ISSN-L)
- 1545-7885
- OpenAlex
- W2062802768
- Cited by
- 860
- References
- 3
- FWCI
- 12.25
- Type
- journal article
- Language
- en
- Open access
- gold
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: Algorithmic Self-Assembly of DNA Sierpinski Triangles. https://app.cochat.ai/papers/10.1371/journal.pbio.0020424
- The paper
- Rothemund, P. W. K., Papadakis, N., & Winfree, E. (2004). Algorithmic Self-Assembly of DNA Sierpinski Triangles. PLoS Biology. https://doi.org/10.1371/journal.pbio.0020424
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.