Advertisement

Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem

  • Muthiah Sakthi Balan
  • Parameswaran Seshan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6031)

Abstract

To solve intractable problems using biomolecules the model requires exponential number of the same. As a proof of concept this model is acceptable, but when it comes to realization of the model the number of biomolecules needed should be drastically reduced by some techniques. In this work we address this issue for peptide computing – we propose a method called incremental building to reduce the number of peptides needed to work with for solving large combinatorial problems. We explain this model for solving the Hamiltonian path problem, analyze the space and time complexity for the same, and also discuss this method from the perspective of molecular computing as a whole and study its implications.

Keywords

Peptide Sequence Hamiltonian Path Exponential Number Intractable Problem Incremental Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 2.
    Balan, M.S., Krithivasan, K., Sivasubramanyam, Y.: Peptide computing: Universality and computing. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 290–299. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Baumgardner, J., Acker, K., Adefuye, O., Crowley, S., DeLoache, W., Dickson, J., Heard, L., Martens, A., Morton, N., Ritter, M., Shoecraft, A., Treece, J., Unzicker, M., Valencia, A., Waters, M., Malcolm, A., Heyer, L., Poet, J., Eckdahl, T.: Solving a hamiltonian path problem with a bacterial computer. Journal of Biological Engineering 3(1), 11 (2009)CrossRefGoogle Scholar
  4. 4.
    Bird, R.E., Hardman, K.D., Jacobson, J.W., Johnson, S., Kaufman, B.M., Lee, S.M., Lee, T., Pope, S.H., Riordan, G.S., Whitlow, M.: Single-chain antigen-binding proteins. Science 242(4877), 423–426 (1988)CrossRefGoogle Scholar
  5. 5.
    Blenner, M., Banta, S.: Characterization of the 4D5Flu single-chain antibody with a stimulus-responsive elastin-like peptide linker: A potential reporter of peptide linker conformation. Protein Science 17, 527–536 (2008)CrossRefGoogle Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, New York (1979)zbMATHGoogle Scholar
  7. 7.
    Hartmanis, J.: On the Weight of Computation. Bulletin of the EATCS 55, 136–138 (1995)zbMATHGoogle Scholar
  8. 8.
    Hudson, N., Mudgett-Hunter, M., Panka, D., Margolies, M.: Immunoglobulin chain recombination among antidigoxin antibodies by hybridoma-hybridoma fusion. J. Immunol. 139, 2715–2723 (1987)Google Scholar
  9. 9.
    Hug, H., Schuler, R.: Strategies for the developement of a peptide computer. Bioinformatics 17, 364–368 (2001)CrossRefGoogle Scholar
  10. 10.
    Huston, J., Levinson, D., Mudgett-Hunter, M., Tai, M.S., Novotny, J., Margolies, M., Ridge, R., Bruccoleri, R., Haber, E., Crea, R., Oppermann, H.: Protein engineering of antibody binding sites: Recovery of specific activity in an anti-digoxin single-chain Fv analogue produced in Escherichia coli. Proc. Natl. Acad. Sci. 85, 5879–5883 (1988)CrossRefGoogle Scholar
  11. 11.
    Păun, G.: Computing with membranes–A variant: P systems with polarized membranes. Intern. J. of Foundations of Computer Science 11(1), 167–182 (2000)CrossRefGoogle Scholar
  12. 12.
    Zhou, H.X.: Quantitative account of the enhanced affinity of two linked scFvs specific for different epitopes on the same antigen. J. Mol. Biol. 329, 1–8 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Muthiah Sakthi Balan
    • 1
  • Parameswaran Seshan
    • 1
  1. 1.E-Comm Research LabInfosys Technologies LimitedBangaloreIndia

Personalised recommendations