A DNA algorithm for the maximal matching problem

DOI10.1134/S0005117915100070MaRDI QIDQ268662zbMATH OpenOpenAlexFDO

Authors Wenxia Li, E. M. Patrikeev, Dongmei Xiao

Publication date 15 April 2016

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117915100070

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
• DNA computing of bipartite graphs for maximum matching
• A DNA procedure for solving the shortest path problem
• A molecular beacon computing model of maximum matching problem
• A batch separation experiment-based DNA algorithm of the maximum independent set problem

Cites work

• scientific article; zbMATH DE number 1236223 (Why is no real title available?)
• PROCEDURES FOR LOGIC AND ARITHMETIC OPERATIONS WITH DNA MOLECULES

Cited in

(11)

• DNA computing of bipartite graphs for maximum matching
• Genetic algorithm in DNA computing: a solution to the maximal clique problem
• A batch separation experiment-based DNA algorithm of the maximum independent set problem
• A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
• scientific article; zbMATH DE number 2087503 (Why is no real title available?)
• scientific article; zbMATH DE number 2087017 (Why is no real title available?)
• A molecular beacon computing model of maximum matching problem
• A DNA procedure for solving the shortest path problem
• Terminal pair maximal flow finding using DNA computation
• Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
• PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA

This page was built for publication: A DNA algorithm for the maximal matching problem

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