scispace - formally typeset
Journal ArticleDOI

Layout-Aware Mixture Preparation of Biochemical Fluids on Application-Specific Digital Microfluidic Biochips

TLDR
A new mixing algorithm based on a number-partitioning technique that determines a layout-aware mixing tree corresponding to a given target ratio of a number of fluids is presented and a routing-aware resource-allocation scheme is proposed that can be used to improve the performance of a given mixing algorithm on a chip layout.
Abstract
The recent proliferation of digital microfluidic (DMF) biochips has enabled rapid on-chip implementation of many biochemical laboratory assays or protocols. Sample preprocessing, which includes dilution and mixing of reagents, plays an important role in the preparation of assays. The automation of sample preparation on a digital microfluidic platform often mandates the execution of a mixing algorithm, which determines a sequence of droplet mix-split steps (usually represented as a mixing graph). However, the overall cost and performance of on-chip mixture preparation not only depends on the mixing graph but also on the resource allocation and scheduling strategy, for instance, the placement of boundary reservoirs or dispensers, mixer modules, storage units, and physical design of droplet-routing pathways. In this article, we first present a new mixing algorithm based on a number-partitioning technique that determines a layout-aware mixing tree corresponding to a given target ratio of a number of fluids. The mixing graph produced by the proposed method can be implemented on a chip with a fewer number of crossovers among droplet-routing paths as well as with a reduced reservoir-to-mixer transportation distance. Second, we propose a routing-aware resource-allocation scheme that can be used to improve the performance of a given mixing algorithm on a chip layout. The design methodology is evaluated on various test cases to demonstrate its effectiveness in mixture preparation with the help of two representative mixing algorithms. Simulation results show that on average, the proposed scheme can reduce the number of crossovers among droplet-routing paths by 89.7p when used in conjunction with the new mixing algorithm, and by 75.4p when an earlier algorithm [Thies et al. 2008] is used.

read more

Citations
More filters

Parallel CAD: Algorithm Design and Programming Special Section Call for Papers TODAES: ACM Transactions on Design Automation of Electronic Systems

TL;DR: This journal special section will cover recent progress on parallel CAD research, including algorithm foundations, programming models, parallel architectural-specific optimization, and verification, as well as other topics relevant to the design of parallel CAD algorithms and software tools.
Journal ArticleDOI

Dilution and Mixing Algorithms for Flow-Based Microfluidic Biochips

TL;DR: The proposed satisfiability-based dilution algorithm outperforms existing dilution algorithms in terms of mixing steps and waste production, and compares favorably with respect to reagent-usage (cost) when 4- and 8-segment rotary mixers are used.
Journal ArticleDOI

Error-Correcting Sample Preparation with Cyberphysical Digital Microfluidic Lab-on-Chip

TL;DR: This article considers imprecise droplet mix-split operations and presents a novel roll-forward approach where the erroneous droplets are used in the error-recovery process, instead of being discarded or remixed.
Proceedings ArticleDOI

Locking of biochemical assays for digital microfluidic biochips

TL;DR: This work proposes to “lock” biochemical assays through random insertion of dummy mix-split operations, subject to several design rules, and experimentally evaluates the proposed locking mechanism, and shows how a high level of protection can be achieved even on bioassays with low complexity.
Journal ArticleDOI

Multitarget Sample Preparation Using MEDA Biochips

TL;DR: This article presents a generic multiple-reactant sample preparation algorithm that exploits the novel fluidic operations on MEDA biochips and proposes an enhanced algorithm that increases the operation-sharing opportunities when multiple target concentrations are needed, and therefore the usage of reactants can be further reduced.
References
More filters
Journal ArticleDOI

Optimization by Simulated Annealing

TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book

Computers and Intractability: A Guide to the Theory of NP-Completeness

TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book

The Design and Analysis of Computer Algorithms

TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book

Algorithm Design

Jon Kleinberg, +1 more
TL;DR: Algorithm Design introduces algorithms by looking at the real-world problems that motivate them and encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
Related Papers (5)