DNA computation for a special integer planning problem

MaRDI QIDQ5319467zbMATH OpenFDO

Authors Lijun Cai, Ya-Ping Lin, Yeqing Yi, Xiaolong Li, Linbo Jiang

Publication date 22 July 2009

zbMATH Keywords

DNA computingfluorescence labelinginteger planning problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10) Protein sequences, DNA sequences (92D20)

Recommendations

• Algorithm of DNA computing on optimal assignment problems
• A microfluidic systems-based DNA algorithm for solving special 0-1 integer programming problem
• DNA computing-based algorithm for assignment problems
• DNA computing model of the 0-1 programming problem
• DNA computing -- A functional model in the practical experiment in the laboratory

Cited in

(12)

• A polynomial-time DNA computing solution for the bin-packing problem
• DNA computation based on self-assembled nanoparticle probes for 0--1 integer programming problem
• A computational DNA solution approach for the quadratic Diophantine equation
• A DNA computing model to solve 0-1 integer programming problem
• Algorithm of DNA computing on optimal assignment problems
• scientific article; zbMATH DE number 5630435 (Why is no real title available?)
• scientific article; zbMATH DE number 1953209 (Why is no real title available?)
• DNA computing-based algorithm for assignment problems
• DNA computing model of the 0-1 programming problem
• Computational and Information Science
• New algorithms for some NP-optimization problems by DNA computing
• A microfluidic systems-based DNA algorithm for solving special 0-1 integer programming problem

This page was built for publication: DNA computation for a special integer planning problem

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