A construction of pooling designs with some happy surprises

Journal of Computational Biology

Volumn 12, Issue 8, 2005, Pages 1129-1136

  D'Yachkov, A ^a   Hwang, Frank ^b   Macula, Antony ^a,c   Vilenkin, Pavel ^a   Weng, Chih Wen ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

Error correction; Pooling designs

Indexed keywords

COMPLEMENTARY DNA; DNA;

ALGORITHM; ARTICLE; BIOTECHNOLOGY; CLONE; DNA LIBRARY; DNA SEQUENCE; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL;

COMPUTATIONAL BIOLOGY; DNA; DNA PROBES; GENOMIC LIBRARY; HUMANS; MATHEMATICS; MODELS, THEORETICAL;

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

References (19)

1. Barrllot, E., Lacroix, B., and Cohen, D. 1995. Theoretical analysis of library screening using an n-dimensional pooling strategy. Nucl. Acids Res. 19, 6241-6247.
2. Bruno, W.J., Knill, E., Balding, D.J., Bruce, D.C., Doggett, N.A., Sawhill, W.W., Stallings, R.L., Whittaker, C.C., and Torney, E.G. 1995. Effective pooling designs of library screening. Genomics 26, 21-30.
3. Colburn, C., Ling, A., and Tompa, M. 2002. Construction of optimal quality control ogilio arrays. Bioinformatics 18(4), 529-535.
4. Du, D., and Hwang, F.K. 2000. Combinatorial Group Testing and Its Applications, 2nd ed., World Scientific, Singapore.
5. Erdös, P., Frankl, and Füredi, D. 1985. Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51, 79-89.
6. Farach, M., Kannan, S., Knill, E., and Muthukrishnan, S. 1997. Group testing problems with sequences experimental molecular biology. Proc. Compression and Complexity of Sequences, 1997, IEEE Press, 357-367.
7. Flodman, P., Macula, A., Spence, A., and Torney, D. 2001. A new data mining technique for the analysis of simulated genetic data. Proc. Genetic Analysis Workshop 12, Wiley-Liss, 2001; Genet. Epidemiol. 21(Suppl. 1), S390-S395.
8. Grebinski, V., and Kucherov, G. 1998. Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping. Disc. Appl. Math. 88, 147-165.
9. Huang, T., and Weng, C. 2004. Pooling spaces and non-adaptive pooling designs. DHC. Math. 282(1-3), 163-169.
10. Hwang, F.K. 2003. On Macula's error-correcting pool designs. Disc. Math. 267, 311-314.
11. Kautz, W.H., and Singleton, R.C. 1964. Nonadaptive binary superimposed codes. IEEE Trans. Inform. Theory 10, 363-377.
12. van Lint, J.H., and Wilson, R.M. 1992. A Course in Combinatorics, Cambridge, Victoria.
13. Macula, A.J. 1996a. A simple construction of d-disjunct matrices with certain constant weights. DHC. Math. 162, 311-312.
14. e-disjunct matrices. DHC. Appl. Math. 80, 217-222.
15. Macula, A.J. 1999. Probabilistic nonadaptive and two-stage group testing with relatively small pools and DNA library screening. J. Comb. Opt. 2, 385-397.
16. Ngo, H., and Du, D. 2002. New constructions of non-adaptive and error-tolerance pooling designs. DHC. Math. 243, 161-170.
17. Pevzner, P.A. 2000. Computational Molcular Biology: An Algorithmic Approach, Mass Sec. 9.5-9.6, MIT Press, Cambridge, MA.
18. Torney, D.C. 1999. Sets pooling designs. Ann. Combin. 3, 95-101.
19. Yakir, A. 1993. Inclusion matrix of k vs 1 affine subspaces and a permutation module of the general affine group. J. Combin. Theory, Ser. A 63, 301-317.