A resolvable r × c grid-block packing and its application to DNA library screening

Yukiyasu Mutoh, Masakazu Jimbo, Hung-Lin Fu

研究成果: Article同行評審

6 引文 斯高帕斯(Scopus)

摘要

For a v-set V, let A be a collection of r × c arrays with elements in V. A pair (V, A) is called an r × c grid-block packing if every two distinct points i and j in V occur together at most once in the same row or in the same column of arrays in A. And an r × c grid-block packing (V, A) is said to be resolvable if the collection of arrays A can be partitioned into sub-classes R1, R2, ..., Rt such that every point of V is contained in precisely one array of each class. These packings have originated from the use of DNA library screening. In this paper, we give some constructions of resolvable r × c grid-block packings and give a brief survey of their application to DNA library screening.

原文English
頁(從 - 到)713-737
頁數25
期刊Taiwanese Journal of Mathematics
8
發行號4
DOIs
出版狀態Published - 1 一月 2004

指紋 深入研究「A resolvable r × c grid-block packing and its application to DNA library screening」主題。共同形成了獨特的指紋。

引用此