A sticker model-based DNA algorithm of maximum clique problem

MaRDI QIDQ3169466zbMATH OpenFDO

Authors Kang Zhou, Shuo Liu, Lei Qin, Xiaowei Yi

Publication date 29 September 2011

zbMATH Keywords

DNA computingelectrophoresis technologymaximum clique problemseparation experimentsticker model

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Protein sequences, DNA sequences (92D20)

Recommendations

• A batch separation experiment-based DNA algorithm of the maximum independent set problem
• Sticker DNA computer model. II: Application
• Efficient DNA sticker algorithms for NP-complete graph problems
• Making all spanning tree problem based on sticker model
• DNA algorithm of map coloring problem based on sticker model

Cited in

(6)

• Efficient DNA sticker algorithms for NP-complete graph problems
• Making all spanning tree problem based on sticker model
• A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
• 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
• DNA algorithm of map coloring problem based on sticker model

This page was built for publication: A sticker model-based DNA algorithm of maximum clique problem

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