IDEAS home Printed from https://ideas.repec.org/a/nat/nature/v407y2000i6803d10.1038_35035038.html
   My bibliography  Save this article

Logical computation using algorithmic self-assembly of DNA triple-crossover molecules

Author

Listed:
  • Chengde Mao

    (New York University)

  • Thomas H. LaBean

    (Duke University)

  • John H. Reif

    (Duke University)

  • Nadrian C. Seeman

    (New York University)

Abstract

Recent work1,2,3 has demonstrated the self-assembly of designed periodic two-dimensional arrays composed of DNA tiles, in which the intermolecular contacts are directed by ‘sticky’ ends. In a mathematical context, aperiodic mosaics may be formed by the self-assembly of ‘Wang’ tiles4, a process that emulates the operation of a Turing machine. Macroscopic self-assembly has been used to perform computations5; there is also a logical equivalence between DNA sticky ends and Wang tile edges6,7. This suggests that the self-assembly of DNA-based tiles could be used to perform DNA-based computation8. Algorithmic aperiodic self-assembly requires greater fidelity than periodic self-assembly, because correct tiles must compete with partially correct tiles. Here we report a one-dimensional algorithmic self-assembly of DNA triple-crossover molecules9 that can be used to execute four steps of a logical (cumulative XOR) operation on a string of binary bits.

Suggested Citation

  • Chengde Mao & Thomas H. LaBean & John H. Reif & Nadrian C. Seeman, 2000. "Logical computation using algorithmic self-assembly of DNA triple-crossover molecules," Nature, Nature, vol. 407(6803), pages 493-496, September.
    • Handle: RePEc:nat:nature:v:407:y:2000:i:6803:d:10.1038_35035038
    DOI: 10.1038/35035038
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/35035038
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1038/35035038?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Paul W K Rothemund & Nick Papadakis & Erik Winfree, 2004. "Algorithmic Self-Assembly of DNA Sierpinski Triangles," PLOS Biology, Public Library of Science, vol. 2(12), pages 1-1, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:nature:v:407:y:2000:i:6803:d:10.1038_35035038. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.