A DNA algorithm for the maximal matching problem
From MaRDI portal
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
Cited in
(11)- DNA computing of bipartite graphs for maximum matching
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
- Genetic algorithm in DNA computing: a solution to the maximal clique problem
- Terminal pair maximal flow finding using DNA computation
- Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
- A batch separation experiment-based DNA algorithm of the maximum independent set problem
- PROCEDURES FOR COMPUTING THE MAXIMUM WITH DNA
- A clause string DNA algorithm for SAT
- An aqueous algorithm for finding the bijections contained in a binary relation
- A molecular beacon computing model of maximum matching problem
- A DNA procedure for solving the shortest path problem
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)