|
Journal of Computational Biology
A Construction of Pooling Designs with Some Happy Surprises
To cite this article:
A. D'Yachkov, Frank Hwang, Antony Macula, Pavel Vilenkin, Chih-Wen Weng.
Journal of Computational Biology.
October 2005,
12(8): 1129-1136.
doi:10.1089/cmb.2005.12.1129.
Published in Volume: 12 Issue 8: October 21, 2005
A. D'Yachkov Department of Probability Theory, Faculty of Mechanics and Mathematics, Moscow State University, Moscow, 119992, Russia. Frank Hwang Department of Applied Mathematics, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 30050, Taiwan. This research was partially supported by a Republic of China NSC grant 92-2115-M-009-014. Antony Macula Department of Probability Theory, Faculty of Mechanics and Mathematics, Moscow State University, Moscow, 119992, Russia. Department of Mathematics, College at Geneseo, State University of New York, Geneseo, NY 14454, USA. This research was partially supported by NSF-DMS 0107179. Pavel Vilenkin Department of Probability Theory, Faculty of Mechanics and Mathematics, Moscow State University, Moscow, 119992, Russia. Chih-Wen Weng Department of Applied Mathematics, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 30050, Taiwan. This research was partially supported by a Republic of China NSC grant 91-2005-M-009-008. The screening of data sets for "positive data objects" is essential to modern technology. A (group) test that indicates whether a positive data object is in a specific subset or pool of the dataset can greatly facilitate the identification of all the positive data objects. A collection of tested pools is called a pooling design. Pooling designs are standard experimental tools in many biotechnical applications. In this paper, we use the (linear) subspace relation coupled with the general concept of a "containment matrix" to construct pooling designs with surprisingly high degrees of error correction (detection.) Error-correcting pooling designs are important to biotechnical applications where error rates often are as high as 15%. What is also surprising is that the rank of the pooling design containment matrix is independent of the number of positive data objects in the dataset.  This paper was cited by:Error-correcting pooling designs associated with the dual space of unitary space and ratio efficiency comparison Geng-sheng Zhang, Xiao-lei Sun, Bo-li Li Journal of Combinatorial Optimization. Aug 2009, Vol. 18, No. 1: 51-63 CrossRef Weighted Superimposed Codes and Constrained Integer Compressed Sensing Wei Dai, Olgica Milenkovic IEEE Transactions on Information Theory. Jun 2009, Vol. 55, No. 5: 2215-2229 CrossRef Two new error-correcting pooling designs from d-bounded distance-regular graphs Xinlu Zhang, Jun Guo, Suogang Gao Journal of Combinatorial Optimization. May 2009, Vol. 17, No. 3: 339-345 CrossRef Constructing error-correcting pooling designs with symplectic space Jun Guo, Yuexuan Wang, Suogang Gao, Jiangchen Yu, Weili Wu Journal of Combinatorial Optimization. Mar 2009 CrossRef Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2 Zengti Li, Suogang Gao, Hongjie Du, Feng Zou, Weili Wu Journal of Combinatorial Optimization. Feb 2009 CrossRef New error-correcting pooling designs associated with finite vector spaces Jizhu Nan, Jun Guo Journal of Combinatorial Optimization. Jan 2009 CrossRef The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design Geng-Sheng Zhang, Yu-Qin Yang Journal of Combinatorial Optimization. Jan 2009 CrossRef Pooling designs associated with unitary space and ratio efficiency comparison Jun Guo Journal of Combinatorial Optimization. Oct 2008 CrossRef On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design Hung Q. Ngo Journal of Combinatorial Optimization. Feb 2008, Vol. 15, No. 1: 61-76 CrossRef
|
|