New constructions of one- and two-stage pooling designs

Journal of Computational Biology

Volumn 15, Issue 2, 2008, Pages 195-205

  Cheng, Yongxi ^a   Du, Ding Zhu ^b  

^a TSINGHUA UNIVERSITY   (China)

^b The University of Texas at Dallas   (United States)

Author keywords

DNA library screening; Nonadaptive group testing; Pooling designs

Indexed keywords

ARTICLE; DNA DETERMINATION; DNA LIBRARY; DNA SCREENING; GENE FUNCTION; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; PROBABILITY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENE LIBRARY; MATHEMATICS; MODELS, THEORETICAL; SEQUENCE ANALYSIS, DNA;

EID: 40049103916     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.0195     Document Type: Article

References (23)

1. Balding, D.J., and Torney, D.C. 1996. Optimal pooling designs with error detection. J. Combin. Theory Ser. A 74, 131-140.
2. Berger, T., Mandell, J. W., and Subrahmanya, P. 2000. Maximally efficient two-stage group testing. Biometrics 56, 833-840.
3. Cheng, Y.X., and Du, D.Z. 2007. Efficient constructions of disjunctmatrices with applications to DNA library screening. J. Comput. Biol. 14, 1208-1216.
4. De Bonis, A., Gasieniec, L., and Vaccaro, U. 2005. Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34, 1253-1270.
5. Dorfman, R. 1943. The detection of defective members of large populations. Ann. Math. Stat. 14, 436-440.
6. Du, D.Z., and Hwang, F.K. 2006. Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Sequencing. World Scientific, New York.
7. Du, D.Z., Hwang, F.K., Wu, W., and Znati T. 2006. New construction for transversal design. J. Comput. Biol. 13, 990-995.
8. D'yachkov, A.G., Macula, A.J., and Rykov, V.V. 2000. New constructions of superimposed codes. IEEE Trans. Inform. Theory 46, 284-290.
9. D'yachkov, A.G., Rykov, V.V., and Rashad A.M. 1989. Superimposed distance codes. Probl. Contr. Inform. Theory 18, 237-250.
10. Eppstein, D., Goodrich, M.T., and Hirschberg, D.S. 2007. Improved combinatorial group testing algorithms for real-world problem sizes. SIAM J. Comput. 36, 1360-1375.
11. Erdös, P., Frankl, P., and Füredi, Z. 1985. Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51, 79-89.
12. Farach, M., Kannan, S., Knill, E., et al. 1997. Group testing problems with sequences in experimental molecular biology. Proc. Compression Complexity Seq. 357-367.
13. Fu, H.L., and Hwang F.K. 2006. A novel use of t-packings to construct d-disjunct matrices. Discrete Appl. Math. 154, 1759-1762.
14. Hwang, F.K., and Sós, V.T. 1987. Non-adaptive hypergeometric group testing. Studia Sci. Math. Hungar. 22, 257-263.
15. Kautz, W.H., and Singleton, R.C. 1964. Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory 10, 363-377.
16. Knill, E. 1995. Lower bounds for identifying subset members with subset queries. Proc. 6th ACM-SIAM Symp. Discrete Algorithms, 369-377.
17. Macula, A.J. 1996. A simple construction of d-disjunct matrices with certain constant weights. Discrete Math. 162, 311-312.
18. e-disjunct matrices. Discrete Appl. Math. 80, 217-222.
19. Macula, A.J. 1999a. Probabilistic nonadaptive group testing in the presence of errors and DNA library screening. Ann. Comb. 3, 61-69.
20. Macula, A. J. 1999b. Probabilistic nonadaptive and two-stage group testing with relatively small pools and DNA library screening. J. Comb. Optim. 2, 385-397.
21. Motwani, R., and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press, New York,.
22. Ngo, H.Q., and Du, D.Z. 2002. New constructions of non-adaptive and error-tolerance pooling designs. Discrete Math. 243, 161-170.
23. Park, H., Wu, W., Liu, Z., et al. 2003. DNA screening, pooling design and simplicial complex. J. Comb. Optim. 7, 389-394.