Solve the partitioning problem by sticker model in DNA computing

DOI10.1080/10020070412331344901zbMATH Open1091.68055OpenAlexW2094310869MaRDI QIDQ2583382FDOQ2583382

Authors: Huiqin Qu, Mingming Lu, Hong Zhu 

Publication date: 16 January 2006

Published in: Progress in Natural Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10020070412331344901

Recommendations

• scientific article; zbMATH DE number 2087016
• scientific article; zbMATH DE number 2040825
• Sticker DNA computer model. II: Application
• scientific article; zbMATH DE number 1241360
• DNA algorithm of map coloring problem based on sticker model

zbMATH Keywords

memory complex

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (6)

• Sticker DNA computer model. II: Application
• Title not available (Why is that?)
• Title not available (Why is that?)
• A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers
• Solving two-dimensional cutting stock problem via a DNA computing algorithm
• Using sticker to solve the 3-dimensional matching problem in molecular supercomputers

This page was built for publication: Solve the partitioning problem by sticker model in DNA computing

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