Peptide computing -- universality and complexity

DOI10.1007/3-540-48017-X_27MaRDI QIDQ4737669zbMATH OpenFDO

Authors M. Sakthi Balan, Kamala Krithivasan, Y. Sivasubramanyam

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2340/23400290.htm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)

Recommendations

• String binding-blocking automata
• Biological computing
• Peptide Computing – Universality and Theoretical Model
• On the universality of peptide computing
• Peptide computers

Cited in

(9)

• Peptide computers
• Universality in Molecular and Cellular Computing
• Incremental building in peptide computing to solve Hamiltonian path problem
• String binding-blocking automata
• Binding-blocking automata
• Peptide Computing – Universality and Theoretical Model
• Peptide computing: a survey
• Aspects of Molecular Computing
• On the universality of peptide computing

This page was built for publication: Peptide computing -- universality and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737669)