Lin C.-XLiu C.-HChen I.-CLee D.THo T.-Y.CHIH-HUNG LIU2022-11-112022-11-1120140738100Xhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84903175186&doi=10.1145%2f2593069.2593084&partnerID=40&md5=5d1d5aa3e671e832555baea9992db454https://scholars.lib.ntu.edu.tw/handle/123456789/624653Rapid growth in capacity makes ow-based micro uidic biochips a promising candidate for biochemical analysis be-cause they can integrate more complex functions. However, as the number of components grows, the total length of ow channels between components must increase exponentially. Recent empirical studies show that long ow channels are vulnerable due to blocking and leakage defects. Thus, it is desirable to minimize the total length of ow channels for robustness. Also, for timing-sensitive biochemical assays, increase in the longest length of ow channel will delay the assay completion time and lead to variation of uid, thereby affecting the correctness of outcome. The increasing num-ber of components, including the pre-placed components, on the chip makes the ow channel routing problem even more complicated. In this paper, we propose an effcient obstacle-avoiding rectilinear Steiner minimum tree algorithm to deal with ow channel routing problem in ow-based micro uidic 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 ow channel. Copyright 2014 ACM.Micro uidic biochip; Routing; Steiner treeAlgorithms; Bioassay; Computer aided design; Decision trees; Forestry; Trees (mathematics); Biochemical analysis; Channel routing problems; Kruskal algorithms; Micro fluidic biochips; Number of components; Rectilinear Steiner minimum trees; Routing; Steiner trees; Biochips; Algorithms; Biological Tests; Cad Cam; Decision Making; Fluidics; Forestryconference paper10.1145/2593069.25930842-s2.0-84903175186