ArticleMicromachines2020
A Routing-Based Repair Method for Digital Microfluidic Biochips Based on an Improved Dijkstra and Improved Particle Swarm Optimization Algorithm.
Article in Micromachines, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- Structural Optimization Design of Microfluidic Chips Based on Fast Sequence Pair Algorithm.Micromachines · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
Abstract
Digital microfluidic biochips (DMFBs) are attractive instruments for obtaining modern molecular biology and chemical measurements. Due to the increasingly complex measurements carried out on a DMFB, such chips are more prone to failure. To compensate for the shortcomings of the module-based DMFB, this paper proposes a routing-based fault repair method. The routing-based synthesis methodology ensures a much higher chip utilization factor by removing the virtual modules on the chip, as well as removing the extra electrodes needed as guard cells. In this paper, the routing problem is identified as a dynamic path-planning problem and mixed path design problem under certain constraints, and an improved Dijkstra and improved particle swarm optimization (ID-IPSO) algorithm is proposed. By introducing a cost function into the Dijkstra algorithm, the path-planning problem under dynamic obstacles is solved, and the problem of mixed path design is solved by redefining the position and velocity vectors of the particle swarm optimization. The ID-IPSO routing-based fault repair method is applied to a multibody fluid detection experiment. The proposed design method has a stronger optimization ability than the greedy algorithm. The algorithm is applied to , , and fault-free chips. The proposed ID-IPSO routing-based chip design method saves 13.9%, 14.3%, and 14.5% of the experiment completion time compared with the greedy algorithm. Compared with a modular fault repair method based on the genetic algorithm, the ID-IPSO routing-based fault repair method has greater advantages and can save 39.3% of the completion time on average in the completion of complex experiments. When the ratio of faulty electrodes is less than 12% and 23%, the modular and ID-IPSO routing-based fault repair methods, respectively, can guarantee a 100% failure repair rate. The utilization rate of the electrodes is 18% higher than that of the modular method, and the average electrode usage time is 17%. Therefore, the ID-IPSO routing-based fault repair method can accommodate more faulty electrodes for the same fault repair rate; the experiment completion time is shorter, the average number of electrodes is lower, and the security performance is better.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.