DNA models and algorithms for NP-complete problems

DOI10.1006/jcss.1998.1586zbMath0921.68028OpenAlexW1964471393MaRDI QIDQ1276167

Eric Bach, Anne Condon, Elton Glaser, Celena Tanguay

Publication date: 17 January 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1998.1586

zbMATH Keywords

DNA computing

Mathematics Subject Classification ID

Related Items (7)

Solving the minimum bisection problem using a biologically inspired computational model ⋮ DNA2DNA computations: A potential “killer app”? ⋮ Is DNA computing viable for 3-SAT problems? ⋮ On the scalability of biocomputing algorithms: the case of the maximum clique problem ⋮ Molecular solution to the optimal linear arrangement problem based on DNA computation ⋮ On the computational power of DNA ⋮ Molecular computing, bounded nondeterminism, and efficient recursion

Cites Work

• Sum of the reciprocals of the binomial coefficients
• Parallel concepts in graph theory
• Probability with Martingales
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: DNA models and algorithms for NP-complete problems