On the universality of peptide computing

DOI10.1007/S11047-007-9045-9MaRDI QIDQ926519zbMATH OpenOpenAlexFDO

Authors M. Sakthi Balan, Helmut Jürgensen

Publication date 20 May 2008

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-007-9045-9

zbMATH Keywords

DNA computingmolecular computingpeptide computingunconventional computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Peptide Computing – Universality and Theoretical Model
• scientific article; zbMATH DE number 2087028
• Peptide computers
• scientific article; zbMATH DE number 2013491
• Programming in biomolecular computation

Cites work

• scientific article; zbMATH DE number 4002093 (Why is no real title available?)
• scientific article; zbMATH DE number 1981720 (Why is no real title available?)
• scientific article; zbMATH DE number 2143014 (Why is no real title available?)
• scientific article; zbMATH DE number 2087028 (Why is no real title available?)
• Maximal solid codes
• On the Minimum Computation Time of Functions

Cited in

(10)

• Peptide computers
• Universality in Molecular and Cellular Computing
• Peptide structure prediction using distributed volunteer computing networks
• scientific article; zbMATH DE number 2013491 (Why is no real title available?)
• scientific article; zbMATH DE number 2087028 (Why is no real title available?)
• Binding-blocking automata
• Peptide Computing – Universality and Theoretical Model
• Peptide computing: a survey
• Aspects of Molecular Computing
• Solving peptide sequencing as satisfiability

This page was built for publication: On the universality of peptide computing

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