Efficient DNA sticker algorithms for NP-complete graph problems

DOI10.1016/S0010-4655(02)00270-9zbMath1001.68092MaRDI QIDQ1605127

Karl-Heinz Zimmermann

Publication date: 11 July 2002

Published in: Computer Physics Communications (Search for Journal in Brave)

zbMATH Keywords

DNA algorithmbiomolecular computingHamiltonian directed path problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ 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 ⋮ Making all spanning tree problem based on sticker model ⋮ A CONSTANT TIME ALGORITHM FOR DNA ADD

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• DNA computing, sticker systems, and universality
• DNA computing: Arrival of biological mathematics
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient DNA sticker algorithms for NP-complete graph problems