A resolvable \(r \times c\) grid-block packing and its application to DNA library screening

DOI10.11650/TWJM/1500407714zbMath1066.05031OpenAlexW4236626462MaRDI QIDQ1771534

Yukiyasu Mutoh, Hung-Lin Fu, Masakazu Jimbo

Publication date: 18 April 2005

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500407714

zbMATH Keywords

lattice square designDNA library screeninggrid-block designgrid-block packing

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Genetics and epigenetics (92D10)

Related Items (6)

A completion of the spectrum of 3-way \((v,k,2)\) Steiner trades ⋮ The existence of \((K_2\times K_6)\)-designs ⋮ Scheduling to reduce close contacts: resolvable grid graph decomposition and packing ⋮ Grid-block difference families and related combinatorial structures ⋮ The decomposition of \(K_v\) into \(K_2\times K_5\)'s ⋮ Resolvable packings ofKvwithK₂ × Kc's

This page was built for publication: A resolvable \(r \times c\) grid-block packing and its application to DNA library screening