Construction of d(H)-disjunct matrix for group testing in hypergraphs

Journal of Combinatorial Optimization

Volumn 12, Issue 3, 2006, Pages 297-301

  Gao, Hong ^a   Hwang, F K ^b   Thai, My T ^c   Wu, Weili ^d   Znati, Taieb ^e  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^c UNIVERSITY OF FLORIDA   (United States)

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

^e UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

Complex; DNA library screening; Group testing; Pooling designs

Indexed keywords

ALGORITHMS; DNA; EDGE DETECTION; MOLECULAR BIOLOGY; NUMERICAL METHODS; TESTING;

COMPLEXES; DNA LIBRARY SCREENING; GROUP TESTING; POOLING DESIGNS;

GRAPH THEORY;

EID: 33748435358     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-9634-z     Document Type: Article

References (16)

1. Barillot E, Lacroix B, Cohen D (1991) Theoretical analysis of library screening using a N-dimensional pooling designs. Nucleic Acids Res 19:6241-6247
2. Dorfman R (1943) The detection of defective members of large populations. Ann Math Statist 14:436-440
3. Du D-Z, Hwang FK (1999) Combinatorial group testing and its applications (2nd ed.). World Scientific, Singapore
4. Du D-Z, Hwang FK (2006) Pooling designs: Group testing in molecular biology. World Scientific, Singapore
5. Du D-Z, Hwang FK, Wu W, Znati T (2004) A new construction of transversal designs, manuscript
6. D'ychkov AG, Macula AJ, Torney DC, Vilenkin PA (2001) Two models of nonadaptive group testing for designing screening experiments. In: Proc. 6th Int. Workshop on Model-Orented Designs and Analysis, pp. 63-75
7. Farach M, Kannan S, Knill E, Muthukrishnan S (1997) Group testing problem with sequences in experimental molecular biology. In: Proc. Compression and Complexity of Sequences, pp 357-367
8. Ngo HQ. Du D-Z (2000) A survey on combinatorial group testing algorithms with applications to DNA library screening. In: Discrete mathematical problems with medical applications (New Brunswick, NJ, 1999), pp. 171-182, DIMACS Ser. Discrete Math Theoret Comput Sci, 55, Amer Math Soc, Providence, RI
9. Macula AJ, Torney DC, Villenkin PA (2000) Two-stage group testing for complexes in the presence of errors. DIMACS Sries Disc Math Theor Comput Sci 55:145-157
10. Macula AJ, Rykov W, Yekhanin S (2004) Trivial two-stage group testing for complexes using almost disjunct matrices. Disc Appl Math 137:97-107
11. Marathe MV, Percus AG, Torney DC (2000) Combinatorial optimization in biology, manuscript
12. Park H, Wu W, Wu X, Zhao HG (2003) DNA screening, nonadaptive group testing, and simplicial complex, J Comb Optim 7:389-394
13. Thierry-Mieg N, Trilling L, Roch J-L (2004) Anovel pooling design for protein-protein interaction mapping. manuscript
14. Torney DC (1999) Sets pooling designs. Ann Comb 3:95-101
15. Triesch E (1996) A group testing problem for hypergraphs of bounded rank. Disc Appl Math 66:185-188
16. Wu W, Li C, Huang X, Li Y (2004) On error-tolerant DNA screening. Discrete Applied Mathematics