Skip to main content

A Method of Error Suppression for Self-assembling DNA Tiles

  • Conference paper
DNA Computing (DNA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3384))

Included in the following conference series:

Abstract

Self-assembling DNA tile is an important method of molecular computation. In this method, DNA tiles self-assemble a large twodimensional lattice by the speci.c hybridization between complementary strands. Hence hybridization is not a deterministic, but stochastic, process which depends on tile concentration and temperature. For that reason, it is di.cult to obtain an aggregate with no error. Growth speed of the aggregate must be very low to obtain an aggregate that contains less errors. Winfree et al. proposed the Proofreading Tile Model (PTM), which achieves both a low error rate and fast growth speed by splitting tiles into pieces to enhance tile speci.city. However, it remains di.cult to implement because it requires a large set of completely orthogonal strands.

This paper presents a novel method called Layered Tile Model (LTM) to realize the reliable self-assembly of DNA tiles. We introduce layered tiles which are covered by other tiles called protective tiles. Those protective tiles verify the correctness of connections of the former tiles. Simulation and analysis are used to evaluate LTM performance. Results demonstrate that LTM o.ers similar performance compared to 2 × 2 PTM. It also has unique properties that are considered to be practical for implementation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Winfree, E., Yang, X., Seeman, N.C.: Universal computation via self-assembly of DNA: Some theory and experiments. In: Landweber, L.F., Baum, E.B. (eds.) DNA Based Computers II, Providence, RI, American Mathematical Society. DIMACS, vol. 44, pp. 191–213 (1996)

    Google Scholar 

  2. Carbone, A., Seeman, N.C.: Circuits and programmable self-assembling DNA structures. In: Proc. Natl. Acad. Sci., USA, vol. 99, pp. 12577–12582 (2002)

    Google Scholar 

  3. Kao, M.Y., Ramachandran, V.: DNA self-assembly for constructing 3D boxes. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 429–440. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Mao, C., LaBean, T.H., Reif, J.H., Seeman, N.C.: Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407, 493–496 (2000)

    Article  Google Scholar 

  5. Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: Symposium on Theory of Computing (STOC), Portland, Oregon, ACM, New York (2000)

    Google Scholar 

  6. Winfree, E., Liu, F., Wenzler, L.A., Seeman, N.C.: Design and self-assembly of two-dimensional DNA crystals. Nature 394, 539–544 (1998)

    Article  Google Scholar 

  7. Yan, H., Feng, L., LaBean, T.H., Reif, J.H.: Parallel molecular computations of pair-wise XOR using DNA ”String Tile” self-assembly. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943, p. 97. Springer, Heidelberg (2004)

    Google Scholar 

  8. Yan, H., LaBean, T.H., Feng, L., Reif, J.H.: Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices. Proc. Natl. Acad. Sci. USA 100, 8103–8108 (2003)

    Article  Google Scholar 

  9. Winfree, E.: Simulations of computing by self-assembly. Technical Report CSTR:1998.22, Caltech (1998)

    Google Scholar 

  10. Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error correction for algorithmic self-assembly. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Wang, H.: Proving theorems by pattern recognition II. Bell System Technical Journal 40, 1–42 (1961)

    Google Scholar 

  12. Wang, H.: Dominoes and the AEA case of the decision problem. In: Fox, J. (ed.) Proceedings of the Symposium on the Mathematical Theory of Automata, Brooklyn, New York, pp. 23–55. Polytechnic Press, New York (1963)

    Google Scholar 

  13. Fu, T.-J., Seeman, N.C.: DNA double-crossover molecules. Biochemistry 32, 3211–3220 (1993)

    Article  Google Scholar 

  14. Biswas, I., Yamamoto, A., Hsieh, P.: Branch migration through DNA sequence heterology. J. Mol. Biol. 279, 795–806 (1998)

    Article  Google Scholar 

  15. Panyutin, I.G., Hsieh, P.: The kinetics of spontaneous DNA branch migration. Proc. Natl. Acad. Sci. USA 91, 2021–2025 (1994)

    Article  Google Scholar 

  16. Turberfield, A.J., Mitchell, J.C.: DNA fuel for free-running nanomachines. Phys. Rev. Lett. 90,118102.1–118102.4 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fujibayashi, K., Murata, S. (2005). A Method of Error Suppression for Self-assembling DNA Tiles. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_10

Download citation

  • DOI: https://doi.org/10.1007/11493785_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26174-2

  • Online ISBN: 978-3-540-31844-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics