Header menu link for other important links
X
Peptide computing - Universality and Complexity
Kamala Krithivasan, Y. Sivasubramanyam
Published in Springer Verlag
2002
Volume: 2340
   
Pages: 290 - 299
Abstract
This paper considers a computational model using the peptide- antibody interactions.Th ese interactions which are carried out in parallel can be used to solve NP-complete problems.I n 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.W e also prove that this of model of computation is computationally complete. © Springer-Verlag Berlin Heidelberg 2002.
About the journal
JournalData powered by TypesetLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherData powered by TypesetSpringer Verlag
ISSN03029743
Open AccessNo
Concepts (9)
  •  related image
    Computation theory
  •  related image
    Peptides
  •  related image
    Computational model
  •  related image
    EXACT COVERS
  •  related image
    HAMILTONIAN PATH PROBLEMS
  •  related image
    MODEL OF COMPUTATION
  •  related image
    Np complete
  •  related image
    SET COVER PROBLEM
  •  related image
    DNA