Incremental building in peptide computing to solve hamiltonian path problem

Authors:
Muthiah Sakthi Balan;Parameswaran Seshan
Affiliations:
E-Comm Research Lab, Infosys Technologies Limited, Bangalore, India;E-Comm Research Lab, Infosys Technologies Limited, Bangalore, India
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 3
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Peptide Computing - Universality and Complexity

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing

Quantified Score

Hi-index	0.00

Visualization

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.