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

Yukiyasu Mutoh, Masakazu Jimbo, Hung-Lin Fu

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)713-737
Number of pages25
JournalTaiwanese Journal of Mathematics
Volume8
Issue number4
DOIs
StatePublished - 1 Jan 2004

Keywords

  • DNA library screening
  • Grid-block design
  • Grid-block packing
  • Lattice square design

Fingerprint Dive into the research topics of 'A resolvable r × c grid-block packing and its application to DNA library screening'. Together they form a unique fingerprint.

  • Cite this