Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem

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.

[1]  Kamala Krithivasan,et al.  Peptide Computing - Universality and Complexity , 2001, DNA.

[2]  K. D. Hardman,et al.  Single-chain antigen-binding proteins. , 1988, Science.

[3]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[4]  Juris Hartmanis,et al.  On the Weight of Computations , 1995, Bull. EATCS.

[5]  A Malcolm Campbell,et al.  Solving a Hamiltonian Path Problem with a bacterial computer , 2009, Journal of biological engineering.

[6]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[7]  M. N. Margolies,et al.  Immunoglobulin chain recombination among antidigoxin antibodies by hybridoma-hybridoma fusion. , 1987, Journal of immunology.

[8]  R. Bruccoleri,et al.  Protein engineering of antibody binding sites: recovery of specific activity in an anti-digoxin single-chain Fv analogue produced in Escherichia coli. , 1988, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Rainer Schuler,et al.  Strategies for the development of a peptide computer , 2001, Bioinform..

[10]  Gheorghe Paun.  Computing with Membranes (P Systems): A Variant , 2000, Int. J. Found. Comput. Sci..

[11]  Huan‐Xiang Zhou.  Quantitative account of the enhanced affinity of two linked scFvs specific for different epitopes on the same antigen. , 2003, Journal of molecular biology.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  M. Blenner,et al.  Characterization of the 4D5Flu single‐chain antibody with a stimulus‐responsive elastin‐like peptide linker: A potential reporter of peptide linker conformation , 2008, Protein science : a publication of the Protein Society.