Efficient constructions of disjunct matrices with applications to DNA library screening

Journal of Computational Biology

Volumn 14, Issue 9, 2007, Pages 1208-1216

  Cheng, Yongxi ^a   Du, Ding Zhu ^b  

^a TSINGHUA UNIVERSITY   (China)

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

Author keywords

Disjunct matrices; DNA library screening; Las Vegas algorithm; Nonadaptive group testing; Pooling designs

Indexed keywords

ARTICLE; DNA LIBRARY; ERROR; GENE FUNCTION; GENETIC ALGORITHM; GENETIC SCREENING; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; PROBABILITY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENE LIBRARY;

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

References (22)

1. Aigner, M. 1996. Searching with lies. J. Combin. Theory Ser. A 74, 43-56.
2. Balding, D.J., and Torney, D.C. 1996. Optimal pooling designs with error detection. J. Combin. Theory Ser. A 74, 131-140.
3. De Bonis, A., Gasieniec, L., and Vaccaro, U. 2005. Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34, 1253-1270.
4. Du, D.Z., and Hwang, F.K. 2006. Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Sequencing. World Scientific, New York.
5. Du, D.Z., Hwang, F.K., Wu, W., et al. 2006. New construction for transversal design. J. Comput. Biol. 13, 990-995.
6. D'yachkov, A.G., Macula, A.J., and Rykov, V.V. 2000. New constructions of superimposed codes. IEEE Trans. Inform. Theory 46, 284-290.
7. D'yachkov, A.G., and Rykov, V.V. 1982. Bounds of the length of disjunct codes. Probl. Contr. Inform. Theory 11, 7-13.
8. D'yachkov, A.G., Rykov, V.V., and Rashad A.M. 1989. Superimposed distance codes. Probl. Contr. Inform. Theory 18, 237-250.
9. 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.
10. 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.
11. Füredi, Z. 1996. On r-cover-free families. J. Combin. Theory Ser. A 73, 172-173.
12. Hwang, F.K., and Sós, V.T. 1987. Non-adaptive hypergeometric group testing. Studia Sci. Math. Hungar. 22, 257-263.
13. Kautz, W.H., and Singleton, R.C. 1964. Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory 10, 363-377.
14. Macula, A.J. 1996. A simple construction of d-disjunct matrices with certain constant weights. Discrete Math. 162, 311-312.
15. Macula, A.J. 1997. Error-correcting nonadaptive group testing with de-disjunct matrices. Discrete Appl. Math. 80, 217-222.
16. Macula, A.J. 1999. Probabilistic nonadaptive group testing in the presence of errors and DNA library screening. Ann. Comb. 3, 61-69.
17. Motwani, R., and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press, New York.
18. Muthukrishnan, S. 1994. On optimal strategies for searching in presence of errors. Proc. 5th ACM-SIAM Symp. Discrete Algorithms (SODA' 94) 680-689.
19. Ngo, H.Q., and Du, D.Z. 2002. New constructions of non-adaptive and error-tolerance pooling designs. Discrete Math. 243, 161-170.
20. Olson, M., Hood, L., Cantor, C., et al. 1989. A common language for physical mapping of the human genome. Science 245, 1434-1435.
21. Park, H., Wu, W., Liu, Z., et al. 2003. DNA screening, pooling design and simplicial complex. J. Comb. Optim. 7, 389-394.
22. Ruszinkó, M. 1994. On the upper bound of the size of the r-cover-free families. J. Combin. Theory Ser. A 66, 302-310.