Solving the maximal matching problem with DNA molecules in Adleman–Lipton model

DOI10.1142/S1793524516500194zbMath1331.05215MaRDI QIDQ2788698

No author found.

Publication date: 22 February 2016

Published in: International Journal of Biomathematics (Search for Journal in Brave)

zbMATH Keywords

Adleman-Lipton modelDNA computationNP-complete problemthe maximal matching problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• A biological algorithm to solve the assignment problem based on DNA molecules computation
• DNA ternary addition
• Solving traveling salesman problem in the Adleman-Lipton model
• PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES
• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA

This page was built for publication: Solving the maximal matching problem with DNA molecules in Adleman–Lipton model