Skip to main content
SpringerLink
Log in
Book cover

DNA Computing Models pp 123–179Cite as

Non-Autonomous DNA Models

  • Chapter
  • First Online:

  • 942 Accesses

Abstract

Early biomolecular computing research focussed on laboratoryscale human-operated DNA models of computation for solving complex computational problems. These models generate large combinatorial libraries of DNA to provide search spaces for parallel filtering algorithms. Many difierent methods for library generation, solution filtering, and output generation were experimentally studied. This chapter addresses the basic filtering models and describes two basic computationally complete and universal DNA models of computation, splicing model and sticker model.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman L (1994) Molecular computation of solutions of combinatorial problems. Science 266:1021–1023

    Article  Google Scholar 

  2. Adleman L (1996) On constructing a molecular computer. DIMACS 27:1–21

    MathSciNet  Google Scholar 

  3. Amos M(2005) Theoretical and experimental DNA computation. Springer, Berlin Heidelberg

    MATH  Google Scholar 

  4. Bach E, Condon A, Glaser E, Tanguay C (1996) DNA models and algorithms for NP-complete problems. Proc 11th Ann IEEE Conf Comp Complex, Philadelphia, 290–299

    Google Scholar 

  5. Braich RS, Chelyapov N, Johnson C, Rothemumd PWK, Adleman L (2002) Solution of a 20-variable 3-sat problem on a DNA computer. Science 296:499– 502

    Article  Google Scholar 

  6. Faulhammer D, Cukras AR, Lipton RJ, Landweber LF (2000) Molecular computation: RNA solutions to chess problems. PNAS 97:1385–1389

    Article  Google Scholar 

  7. FellerW(1968) An introduction to probability theory and its applications. Wiley, New York

    MATH  Google Scholar 

  8. Feynman RP (1961) Miniaturization. In: Gilbert DH (ed.). Reinhold, New York

    Google Scholar 

  9. Freund R, Kari L, Pâun G (1999) DNA computing based on splicing: the existence of universal computers. Theory Comp Systems 32:69–112

    Article  MATH  Google Scholar 

  10. Gibbons A, Amos M, Hodgson D (1996) Models of DNA computation. LNCS 1113:18–36

    MathSciNet  Google Scholar 

  11. Guo M, Chang WL, Ho M, Lu J, Cao J (2005) Is optimal solution of every NPcomplete or NP-hard problem determined from its characteristic for DNA-based computing? Biosystems 80:71–82

    Article  Google Scholar 

  12. Head T (1987) Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull Math Biol 47:737–759

    MathSciNet  Google Scholar 

  13. Henkel CV, Rozenberg G, Spaink H (2005) Application to mismatch detection methods in DNA computing. LNCS 3384:159–168

    MathSciNet  Google Scholar 

  14. Lipton RJ (1995) DNA solution of hard combinatorial problems. Science 268: 542–545

    Article  Google Scholar 

  15. Liu Q, Wang L, Frutos AG, Condon AE, Corn RM, Smith LM (2000) A surfacebased approach to DNA computing. Nature 403:175–179

    Article  Google Scholar 

  16. Liu Q, Wang L, Frutos AG, Condon AE, Corn RM, Smith LM (2000) DNA computing on surfaces. Nature 403:175–179

    Article  Google Scholar 

  17. Martinez-Perez I (2007) Biomolecular computing models for graph problems and finite state automata. Ph.D. thesis Hamburg Univ Tech

    Google Scholar 

  18. Ouyang Q, Kaplan PD, Liu S, Libchaber A (1997) DNA solution of the maximal clique problem. Science 278:446–449

    Article  Google Scholar 

  19. Păun G, Rozenberg G, Salomaa A (1998) DNA computing: new computing paradigms. Springer, New York

    Google Scholar 

  20. RheoGene (2005) Market Wire

    Google Scholar 

  21. Roweis S, Winfree E, Burgoyne R, Chelyapov N, Goodman M, Rothemund P, Adleman L (1996) A sticker based architecture for DNA computation. In: Baum EB (ed.) DNA Based Computers 1–27

    Google Scholar 

  22. Rozenberg G, Spaink H (2003) DNA computing by blocking. Theoret Comp Sci 292:653–665

    Article  MATH  MathSciNet  Google Scholar 

  23. Sakakibara Y, Suyama A (2000) Intelligent DNA chips: logical operation of gene expression proviles on DNA computers. Genome Inform 11:33–42

    Google Scholar 

  24. Scharrenberg O (2007) Programming of stickers machines. Project Work, Hamburg Univ Tech

    Google Scholar 

  25. Zimmermann KH (2002) On applying molecular computation to binary linear codes. IEEE Trans Inform Theory 48:505–510

    Article  MATH  MathSciNet  Google Scholar 

  26. Zimmermann KH (2002) Efficient DNA sticker algorithms for NP-complete graph problems. Comp Phys Comm 114:297-309

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cellular Biochemistry, Max Planck Institute of Biochemistry, Munich, 82152 Martinsried by Munich, Germany

    Zoya Ignatova

  2. Institute of Computer Technology, Hamburg University of Technology, 21071 Hamburg, Germany

    Karl-Heinz Zimmermann & Israel Martínez-Pérez

Authors
  1. Zoya Ignatova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karl-Heinz Zimmermann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Israel Martínez-Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zoya Ignatova .

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag US

About this chapter

Cite this chapter

Ignatova, Z., Zimmermann, KH., Martínez-Pérez, I. (2008). Non-Autonomous DNA Models. In: DNA Computing Models. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-73637-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-73637-2_5

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-73635-8

  • Online ISBN: 978-0-387-73637-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation