A molecular beacon computing model of maximum matching problem

DOI10.3969/J.ISSN.1003-5060.2013.11.026MaRDI QIDQ4980914zbMATH OpenFDO

Authors Jing Yang, Zhixiang Yin, Mingqiang Chen, Kaifeng Huang

Publication date 30 June 2014

Full work available at URL https://doi.org/10.3969/J.ISSN.1003-5060.2013.11.026

zbMATH Keywords

DNA computingmaximum matchingmolecular beaconmolecular beacon probeNP-complete problem

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20)

Recommendations

• Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
• A DNA algorithm for the maximal matching problem
• scientific article; zbMATH DE number 5260685
• DNA computing of bipartite graphs for maximum matching
• DNA models and algorithms for NP-complete problems

Cited in

(5)

• DNA computing of bipartite graphs for maximum matching
• A DNA algorithm for the maximal matching problem
• Solving the maximal matching problem with DNA molecules in Adleman-Lipton model
• Using sticker to solve the 3-dimensional matching problem in molecular supercomputers
• scientific article; zbMATH DE number 5260685 (Why is no real title available?)

This page was built for publication: A molecular beacon computing model of maximum matching problem

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