A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips

August 20, 2019 Β· Declared Dead Β· πŸ› Workshop on Algorithms and Computation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Miguel Coviello Gonzalez, Marek Chrobak arXiv ID 1908.09618 Category cs.DS: Data Structures & Algorithms Cross-listed cs.DM Citations 1 Venue Workshop on Algorithms and Computation Last Checked 4 months ago
Abstract
We address the problem of designing micro-fluidic chips for sample preparation, which is a crucial step in many experimental processes in chemical and biological sciences. One of the objectives of sample preparation is to dilute the sample fluid, called reactant, using another fluid called buffer, to produce desired volumes of fluid with prespecified reactant concentrations. In the model we adopt, these fluids are manipulated in discrete volumes called droplets. The dilution process is represented by a mixing graph whose nodes represent 1-1 micro-mixers and edges represent channels for transporting fluids. In this work we focus on designing such mixing graphs when the given sample (also referred to as the target) consists of a single-droplet, and the objective is to minimize total fluid waste. Our main contribution is an efficient algorithm called RPRIS that guarantees a better provable worst-case bound on waste and significantly outperforms state-of-the-art algorithms in experimental comparison.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted