Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A tissue P system and a DNA microfluidic device for solving the shortest common superstring problem
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Towards a re-programmable DNA computer
Natural Computing: an international journal
Automated Design and Programming of a Microfluidic DNA Computer
Natural Computing: an international journal
Hi-index | 0.00 |
Microfluidic systems, which constitute a miniaturization of a conventional laboratory to the dimensions of a chip, are expected to become the key support for a revolution in the world of biology and chemistry. This article proposes a parallel algorithm that uses DNA and such a distributed microfluidic device to generate scheduling grids in polynomial time. Rather than taking a brute force approach, the algorithm presented here uses concatenation and separation operations to gradually build the DNA strings that represent a Multiprocessor Task scheduling problem grids. The microfluidic device used makes for an autonomous system, also enabling it to solve the problem without the need of external control.