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.

A new microfluidic methodology to assess the haemocompatibility of magnetic nanoparticles designed for theranostic applications

The remarkable physicochemical properties of magnetic nanoparticles (MNPs) at the nanoscale have boosted the development of new and promising strategies for the simultaneous diagnosis and treatment of diseases, particularly in cancer therapy Ð the so-called theranostic applications (1). In these strategies, the intrinsic superparamagnetic properties of MNPs have been exploited to gain access into multifunctional systems able to simultaneously perform as enhanced magnetic resonance imaging (MRI) contrast agents, efficient nanocarriers for drug delivery and nanoheaters in magnetic hyperthermia based therapy (2), among others.