PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA

DOI10.1142/S0129054107004796zbMath1117.68034MaRDI QIDQ3444840

Akiko Takehara, Satoshi Kamio, Akihiro Fujiwara

Publication date: 5 June 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

DNA computing

Mathematics Subject Classification ID

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

Related Items (4)

DNA ternary addition ⋮ A DNA procedure for solving the shortest path problem ⋮ Solving traveling salesman problem in the Adleman-Lipton model ⋮ Solving the maximal matching problem with DNA molecules in Adleman–Lipton model

Cites Work

• Parallel biomolecular computation: Models and simulations
• PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES
• Finding the maximum, merging, and sorting in a parallel computation model
• Parallel Scheduling Algorithms

This page was built for publication: PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA