標題: Random pooling designs under various structures
作者: Hwang, FK
Liu, YC
應用數學系
Department of Applied Mathematics
關鍵字: random pooling designs;clone library screening;k-clique
公開日期: 1-Dec-2003
摘要: Balding et al. ( 1995) showed that randomizing over the k-set space yields much better pooling designs than the random pooling design without the k-restriction. A natural question arises as to whether a smaller subspace, i.e., a space with more structure, will yield even better results. We take the random subset containment design recently proposed by Macula, which randomizes over a subspace of the k-set space, as our guinea pig to compare with the k-set space. Unfortunately the performance of the subset containment design is hard to analyze and only approximations are given. For a set of parameters, we are able to produce either an exact analysis or very good approximations. The comparisons under these parameters seem to favor the k-set space.
URI: http://dx.doi.org/10.1023/B:JOCO.0000017382.83399.0b
http://hdl.handle.net/11536/27334
ISSN: 1382-6905
DOI: 10.1023/B:JOCO.0000017382.83399.0b
期刊: JOURNAL OF COMBINATORIAL OPTIMIZATION
Volume: 7
Issue: 4
起始頁: 339
結束頁: 352
Appears in Collections:Articles


Files in This Item:

  1. 000189208100002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.