scientific article; zbMATH DE number 2040825

zbMATH Open1038.68046MaRDI QIDQ4451919FDOQ4451919

Authors: Minyi Guo, Michael Ho, W.-L. Chang 

Publication date: 11 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2745/27450185.htm

Title of this publication is not available (Why is that?)

Recommendations

• Using sticker to solve the 3-dimensional matching problem in molecular supercomputers
• On the power of DNA-computing
• Solve the partitioning problem by sticker model in DNA computing
• DNA models and algorithms for NP-complete problems
• Sticker DNA computer model. II: Application

zbMATH Keywords

DNA computingNP-complete problemsset-splitting problem' Adleman-Lipton modelsticker-based model

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parallel algorithms in computer science (68W10)

Cited In (2)

• Solve the partitioning problem by sticker model in DNA computing
• Solving two-dimensional cutting stock problem via a DNA computing algorithm

This page was built for publication:

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