首页> 外文会议>ACM/EDAC/IEEE Design Automation Conference >An efficient bi-criteria flow channel routing algorithm for flow-based microfluidic biochips
【24h】

An efficient bi-criteria flow channel routing algorithm for flow-based microfluidic biochips

机译:基于流量的微流体生物芯片的高效二标准流动通道路由算法

获取原文

摘要

Rapid growth in capacity makes flow-based microfluidic biochips a promising candidate for biochemical analysis because they can integrate more complex functions. However, as the number of components grows, the total length of flow channels between components must increase exponentially. Recent empirical studies show that long flow channels are vulnerable due to blocking and leakage defects. Thus, it is desirable to minimize the total length of flow channels for robustness. Also, for timing-sensitive biochemical assays, increase in the longest length of flow channel will delay the assay completion time and lead to variation of fluid, thereby affecting the correctness of outcome. The increasing number of components, including the pre-placed components, on the chip makes the flow channel routing problem even more complicated. In this paper, we propose an efficient obstacle-avoiding rectilinear Steiner minimum tree algorithm to deal with flow channel routing problem in flow-based microfluidic biochips. Based on the concept of Kruskal algorithm and formulating the considerations as a bi-criteria function, our algorithm is capable of simultaneously minimizing the total length and the longest length of flow channel.
机译:能力的快速增长使流动的微流体生物切片成为生化分析的有希望的候选者,因为它们可以集成更复杂的功能。然而,随着组件数量的增长,部件之间的流量通道的总长度必须呈指数增加。最近的实证研究表明,由于堵塞和泄漏缺陷,长流动通道易受攻击。因此,期望最小化流动通道的总长度,用于鲁棒性。而且,对于定时敏感的生物化学测定,流动通道长度的增加将延迟测定完成时间并导致流体的变化,从而影响结果的正确性。芯片上越来越多的组件,包括预放置的组件,使流动通道路由问题更加复杂。在本文中,我们提出了一种有效的避免直线静脉静脉最小树算法,以处理流动的微流体生物芯片中的流道路由问题。基于秩算法的概念和配制考虑为双准则函数,我们的算法能够同时最小化总长度和流动通道的长度最长。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号