Solve the partitioning problem by sticker model in DNA computing

DOI10.1080/10020070412331344901zbMath1091.68055OpenAlexW2094310869MaRDI QIDQ2583382

Mingming Lu, Huiqin Qu, 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

zbMATH Keywords

memory complex

Mathematics Subject Classification ID

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

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