Abstract
Given n clones with some positive ones, the pooling design is a non-adapted algorithm to identify all positive clones. Given a pooling design and outcomes from all pools, how to determine each clone being positive or not. We study this decoding problem in this paper. Especially, we give a new decoding method for error-correcting pooling design with (d,k)-disjunct matrix.
Similar content being viewed by others
References
D.-Z. Du and F.K. Hwang, Combinatorial Group Testing and Its Applications, 2nd edition, World Scientific: Singapore, 1999.
T. Huang and C.-W. Weng, “A note on decoding of superimposed codes,” Journal of Combinatorial Optimization, vol. 4, 2003.
F.K. Hwang, “On Macula's error-correcting pooling design,” Discrete Mathematics, 2003 (to appear). M. Li, private communication.
W.W. Paterson, Error Correcting Codes, MIT Press: Cambridge, MA 1961.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, W., Li, C., Wu, X. et al. Decoding in Pooling Designs. Journal of Combinatorial Optimization 7, 385–388 (2003). https://doi.org/10.1023/B:JOCO.0000017387.34879.58
Issue Date:
DOI: https://doi.org/10.1023/B:JOCO.0000017387.34879.58