Shortening the computational time of the fluorescent DNA computing

DOI10.1007/3-540-36440-4_8MaRDI QIDQ4414662zbMATH OpenFDO

Authors Yoichi Takenaka, Akihiro Hashimoto

Publication date 25 July 2003

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/2568/25680085.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Protein sequences, DNA sequences (92D20)

Recommendations

• A proposal of DNA computing on beads with application to SAT problems
• DNA computing model of the 0-1 programming problem
• DNA computation for a special integer planning problem
• On the computational power of DNA
• Solutions of shortest path problems by concentration control

Cited in

(1)

• A proposal of DNA computing on beads with application to SAT problems

This page was built for publication: Shortening the computational time of the fluorescent DNA computing

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