PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA

DOI10.1142/S0129054107004796MaRDI QIDQ3444840zbMATH OpenFDO

Authors Akihiro Fujiwara, Satoshi Kamio, Akiko Takehara

Publication date 5 June 2007

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

Full work available at URL https://doi.org/10.1142/S0129054107004796

zbMATH Keywords

DNA computing

Mathematics Subject Classification ID

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

Recommendations

• Terminal pair maximal flow finding using DNA computation
• A DNA algorithm for the maximal matching problem
• scientific article; zbMATH DE number 194302
• A DNA procedure for solving the shortest path problem
• In Search of Optimal Codes for DNA Computing
• scientific article; zbMATH DE number 1343483
• Algorithm of DNA computing on optimal assignment problems
• On the computational power of DNA
• PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES
• A numerical representation of DNA sequences and its applications

Cites work

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

Cited in

(5)

• Solving traveling salesman problem in the Adleman-Lipton model
• Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
• PROCEDURES FOR MULTIPLE INPUT FUNCTIONS WITH DNA MOLECULES
• DNA ternary addition
• A DNA procedure for solving the shortest path problem

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

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