Using three-dimensional microfluidic networks for solving computationally hard problems

This paper describes the design of a parallel algorithm that uses moving fluids in a three-dimensional microfluidic system to solve a nondeterministically polynomial complete problem (the maximal clique problem) in polynomial time. This algorithm relies on (i) parallel fabrication of the microfluidic system, (ii) parallel searching of all potential solutions by using fluid flow, and (iii) parallel optical readout of all solutions. This algorithm was implemented to solve the maximal clique problem for a simple graph with six vertices. The successful implementation of this algorithm to compute solutions for small-size graphs with fluids in microchannels is not useful, per se, but does suggest broader application for microfluidics in computation and control.

[1]  A Manz,et al.  Chemical amplification: continuous-flow PCR on a chip. , 1998, Science.

[2]  F Guarnieri,et al.  Maya Blue Paint: An Ancient Nanostructured Material , 1996, Science.

[3]  Brian N. Johnson,et al.  An integrated nanoliter DNA analysis device. , 1998, Science.

[4]  Allen Van Gelder,et al.  Computer Algorithms: Introduction to Design and Analysis , 1978 .

[5]  N. Gershenfeld,et al.  Bulk Spin-Resonance Quantum Computation , 1997, Science.

[6]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[7]  G M Whitesides,et al.  Fabrication of topologically complex three-dimensional microfluidic systems in PDMS by rapid prototyping. , 2000, Analytical chemistry.

[8]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[9]  G. Whitesides,et al.  Patterned deposition of cells and proteins onto surfaces by using three-dimensional microfluidic systems. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[10]  G. Whitesides,et al.  Rapid Prototyping of Microfluidic Systems in Poly(dimethylsiloxane). , 1998, Analytical chemistry.

[11]  Kimble,et al.  Unconditional quantum teleportation , 1998, Science.

[12]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[13]  Enrique Mérida Casermeiro,et al.  Modelling competitive Hopfield networks for the maximum clique problem , 2003, Comput. Oper. Res..

[14]  John Ross,et al.  Implementation of logic functions and computations by chemical kinetics , 1995 .

[15]  J. Ross,et al.  Experiments on Pattern Recognition by Chemical Kinetics , 1995 .

[16]  G. Kovacs.  Micromachined Transducers Sourcebook , 1998 .

[17]  Elena Marchiori.  A simple heuristic based genetic algorithm for the maximum clique problem , 1998, SAC '98.

[18]  D. Beebe,et al.  Three-dimensional micro-channel fabrication in polydimethylsiloxane (PDMS) elastomer , 2000, Journal of Microelectromechanical Systems.

[19]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[20]  D. Leung,et al.  Experimental realization of a quantum algorithm , 1998, Nature.