Skip to main content
SpringerLink
Log in

Peptide Computing - Universality and Complexity

  • Conference paper
  • First Online:
DNA Computing (DNA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2340))

Included in the following conference series:

Abstract

This paper considers a computational model using the pep-tide-antibody interactions. These interactions which are carried out in parallel can be used to solve NP-complete problems. In this paper we show how to use peptide experiments to solve the Hamiltonian Path Problem (HPP) and a particular version of Set Cover problem called Exact Cover by 3-Sets problem. We also prove that this of model of computation is computationally complete.

Financial support from Infosys Technologies Limited, India is acknowledged

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

Access this chapter

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 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. L.M. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994), 1021–1024.

    Article  Google Scholar 

  2. Hubert Hug and Rainer Schuler, Strategies for the developement of a peptide computer, Bioinformatics, to appear.

    Google Scholar 

  3. Y. Aoi, T. Yoshinobu, K. Kinoshita, and H. Iwasaki, Ligation errors in DNA computing, Biosystems 52 (1999), 181–187.

    Article  Google Scholar 

  4. A.G. Frutos, Q. Liu, A.J. Thiel, A.M. Sanner, A.E. Condon, L.M. Smith, and R.M. Corn, Demonstration of a word design strategy for DNA computing on surfaces, Nucl. Acids Res. 25 (1997), 4748–4757.

    Article  Google Scholar 

  5. S. Hashida, K. Hashinaka, and E. Ishikawa, Ultrasensitive enzyme immunoassay, Biotechnol. Annu. Rev. 1 (1995), 403–451.

    Article  Google Scholar 

  6. K. Shreder, Synthetic haptens as probes of antibody response and immunorecognition, Methods 20 (2000), 372–379.

    Article  Google Scholar 

  7. Richard Lipton, DNA Solution of Hard Computational problems, Science 268 (1995), 542–545.

    Article  Google Scholar 

  8. Donald Beaver, Universality and Complexity of Molecular Computation, “ACM Symposium,’ 1996.

    Google Scholar 

  9. Michael R. Garey and David S. Johnson, “Computers and Intractability A Guide to the Theory of NP-Completeness,” W.H. Freeman and Company, 1979.

    Google Scholar 

  10. D. Rooß and K.W. Wagner, On the power of DNA-computing, Information and Computation 131 (1996), 95–109.

    Article  MATH  MathSciNet  Google Scholar 

  11. Nadia Pisanti, DNA computing: a survey, in “Bulletin of the European Association for Theoretical Computer Science,” no. 64, 1998, pp. 188–216.

    Google Scholar 

  12. John E. Hopcroft and Jeffrey D. Ullman, “Introduction to Automata Theory, Languages, and Computation,” Addison-Wesley, 1979.

    Google Scholar 

  13. Gh. Păun, G. Rozenberg, and A. Salomaa, “DNA Computing,” Springer-Verlag, 1998.

    Google Scholar 

  14. L. Kari, DNA computing: tommorrow’s reality, in “Bulletin of the European Association for Theoretical Computer Science,” no. 59, 1996, pp. 256–266.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Madras Chennai, 600036, India

    M. Sakthi Balan, Kamala Krithivasan & Y. Sivasubramanyam

Authors
  1. M. Sakthi Balan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamala Krithivasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Y. Sivasubramanyam
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of South Florida, 4202 E. Fowler A. PHY 114, Tampa, FL, 33620, USA

    Nataša Jonoska

  2. Department of Chemistry, New York University, New York, NY, 10003, USA

    Nadrian C. Seeman

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balan, M.S., Krithivasan, K., Sivasubramanyam, Y. (2002). Peptide Computing - Universality and Complexity. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-48017-X_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43775-8

  • Online ISBN: 978-3-540-48017-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation