TY - JOUR

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

AU - Mutoh, Yukiyasu

AU - Jimbo, Masakazu

AU - Fu, Hung-Lin

PY - 2004/1/1

Y1 - 2004/1/1

N2 - 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.

AB - 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.

KW - DNA library screening

KW - Grid-block design

KW - Grid-block packing

KW - Lattice square design

UR - http://www.scopus.com/inward/record.url?scp=25844460769&partnerID=8YFLogxK

U2 - 10.11650/twjm/1500407714

DO - 10.11650/twjm/1500407714

M3 - Article

AN - SCOPUS:25844460769

VL - 8

SP - 713

EP - 737

JO - Taiwanese Journal of Mathematics

JF - Taiwanese Journal of Mathematics

SN - 1027-5487

IS - 4

ER -