Dilution and Mixing Algorithms for Flow-Based Microfluidic Biochips
Citations
27 citations
Cites background or methods from "Dilution and Mixing Algorithms for ..."
...Since O is a mixing ratio, it must satisfy ∑k i=1 ci = 1 [19]....
[...]
...This process is called sample preparation [17], [18], [19], and in a DMFB it is typically implemented by repeatedly mixing two droplets of equal volume and splitting the resultant droplet into two equal size droplets (i....
[...]
23 citations
17 citations
Cites background from "Dilution and Mixing Algorithms for ..."
...5 2n [8], [9], each CF is represented as an n-bit binary fractional number x 2n , where x ∈ N, 0 ≤ x ≤ 2, and n ∈ N [29]....
[...]
15 citations
Cites background from "Dilution and Mixing Algorithms for ..."
...Because of the (1:1) inherent mixing model supported by DMFB platform, each CF is required to be approximated as n-bit binary fractional number (x/2n), depending on ; where x ∈ N, 0 ≤ x ≤ 2n, and n ∈ N [19]....
[...]
...Efficient sample preparation is thus a basic step in a biochemical protocol, where the objective is to prepare a homogeneous solution of two or more biochemical fluidic reagents in a given volumetric ratio with minimum reagent-cost and time [19]....
[...]
15 citations
Cites background from "Dilution and Mixing Algorithms for ..."
...Previous work on flow-based microfluidic biochips (FMFBs), on the other hand, exploits the use of a rotary mixer that can blend more-than-two solutions in a single mixing operation [29], [30]....
[...]
References
6,859 citations
"Dilution and Mixing Algorithms for ..." refers methods in this paper
...We use a modeling that solves the dilution problem based on decision procedures over linear arithmetic, i.e., by utilizing the deductive power of solvers for SMT [25]....
[...]
...Note that decision procedures of the SMT-over-linear-arithmetic is sound and complete [26]....
[...]
...Next, we invoke the SMT(LA) solver [22] to check whether there exists a satisfiable assignment of underlying variables that can generate the target CF using only one unit of sample....
[...]
...Therefore, the consistency conditions at depth j are given by xj + yj + d∑ i=j+1 wi,j = N, j−1∑ i=1 wj,i ≤ N. (3) Algorithm 2: FloSPA-D(Ct, , N) Input: Ct : target CF, : accuracy, N: mixer-N Output: Dilution Graph 1 Approximate Ct by choosing the smallest d ∈ N such that | xx+y − Ct | < ; Target ratio is {x : y}, where x + y = Nd and 1 ≤ x ≤ Nd − 1; /* Detailed modeling is discussed in Section VI-B */ 2 M = SMT instance generated from a dilution graph of depth d and{x : y}; /* one sample_unit is equal to the volume of ‘reagent’ in one segment of rotary mixer */ 3 sample_unit = 1; 4 M′ = M ∧ (∑di=1 xi = sample_unit); 5 checkSAT(M′); 6 while M′ is unsatisfiable do 7 sample_unit = sample_unit + 1; 8 M′ = M ∧ (∑di=1 xi = sample_unit); 9 checkSAT(M′); 10 Obtain dilution graph from satisfiable assignments of M′; 11 return dilution graph; Finally, all weights must satisfy 0 ≤ wi,j ≤ N −1, for 1 ≤ j < i ≤ d. Similarly, 0 ≤ xi, yi ≤ N − 1 for 1 ≤ i ≤ d....
[...]
...In this section, we discuss how an SMT-based approach can be extended to implement the more general problem of mixture-preparation....
[...]
1,536 citations
"Dilution and Mixing Algorithms for ..." refers background in this paper
..., dropletbased [1]–[8], digital [2], [9], and continuous flow-based microfluidics [10]....
[...]
...More complex units such as mixers, micropumps, and multiplexers can be built with several hundreds of such units accommodated on a single chip [10]....
[...]
1,016 citations
"Dilution and Mixing Algorithms for ..." refers background in this paper
...CFMBs are quite popular in the biochemistry community because of their simplicity of fabrication, flexibility in reagent-volume control, and versatility of applications such as automation of assays and point-of-care diagnosis [11]....
[...]
910 citations
"Dilution and Mixing Algorithms for ..." refers background in this paper
...flow-based microfluidic mixing operations are quite slow [21],...
[...]
900 citations
"Dilution and Mixing Algorithms for ..." refers background or methods in this paper
...The SMT(LA) problem is to determine an assignment to the variables of , if there exists a satisfiable assignment, otherwise to prove that no such assignment exists [26]....
[...]
...The SMT over linear arithmetic [SMT(LA)] problem is defined as follows....
[...]
...The proposed algorithms utilize an SMT-based solving engine that is capable of handling both dilution and mixing problems within the same framework....
[...]
...Although SMT-solvers are used to solve a decision problem, an optimization problem can be formulated as a sequence of decision problems....
[...]
...Next, we invoke the SMT(LA) solver [22] to check whether there exists a satisfiable assignment of underlying variables that can generate the target CF using only one unit of sample....
[...]