Non-adaptive group testing in the presence of errors

Discrete Applied Mathematics

Volumn 88, Issue 1-3, 1998, Pages 261-290

  Knill, E ^a   Bruno, W J ^a   Torney, D C ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039528957     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00075-4     Document Type: Article

References (24)

1. D.J. Balding, W.J. Bruno, E.H. Knill, D.C. Torney, A comparative survey of non-adaptive pooling designs, in: Genetic Mapping and DNA Sequencing, of IMA Volumes in Mathematics and its Applications, vol. 81, Springer, Berlin, 1995, pp. 133-155.
2. D.J. Balding, D.C. Torney, Optimal pooling with error detection, J. Combin. Theory A 74 (1996) 131-140.
3. E. Barillot, B. Lacroix, D. Cohen, Theoretical analysis of library screening using an n-dimensional pooling strategy, Nucleic Acids Res. (1991) 6241-6247.
4. T. Beth, D. Jungnickel, H. Lenz, Design Theory, Cambridge University Press, Cambridge, 1986.
5. W.J. Bruno, D.J. Balding, E.H. Knill, D. Bruce, C. Whittaker, N. Doggett, R. Stallings, D.C. Torney, Design of efficient pooling experiments, Genomics 26 (1995) 21-30.
6. W.J. Bruno, F. Sun, D.C. Torney. Group testing designs for partially characterized objects, Technical report, Los Alamos National Laboratory, 1996, submitted.
7. R.S. Casey et al. (eds.), Punched Cards, Their Applications to Science and Industry, Reinhold, New York, 1958.
8. R. Dorfman, The detection of defective members of large populations, Ann. Math. Statist. 14 (1943) 436-440.
9. A.G. Dyachkov, V.V. Rykov, A survey of superimposed code theory, Problems Control Inform. Theory 12 (1983) 1-13.
10. A.G. Dyachkov, V.V. Rykov, A.M. Rashad, Superimposed distance codes, Problems Control Inform. Theory 18 (1989) 237-250.
11. A. Gerardin, Sphinx-Oedipe, 11 (1916) 68-70.
12. W.H. Kautz, R.C. Singleton, Nonrandom binary superimposed codes, IEEE Trans. Inform. Theory 10 (1964) 363-377.
13. E. Knill, Lower bounds for identifying subset members with subset queries, in: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery & Society for Industrial and Applied Mathematics, 1995, pp. 369-377.
14. E. Knill, S. Muthukrishnan, Group testing problems in experimental computational biology, Technical Report LAUR-95-1503, Los Alamos National Laboratory, 1994.
15. E. Knill, A. Schliep, D. Torney, Baysean decoding of pooling results using the monte carlo method, J. Comput. Biol. 3(LAUR-95-2402) (1996) 395-406.
16. M. Kraitchik, Mathématique des Jeux ou Recreations Mathématique (Mathematical Recreations), Dover, New York, 1930, 2nd rev. ed., 1953.
17. D. Kurtz, M. Sidi, Multiple-access algorithms via group testing for heterogenous populations of users, IEEE Trans. Commun. 36 (1988) 1316-1323.
18. E.S. Lander, M.S. Waterman, Genomic mapping by fingerprinting random clones, Genomics 2 (1988) 231-239.
19. R.C. Minnick, Simultaneous-access matrix storage systems, in: Proceedings of the International Symposium on the Theory of Switching, Harvard University Press, Cambridge, MA, 1957, pp. 144-148.
20. G. Orosz, L. Takacs, Some probability problems concerning the marking of codes into the superimposition field, J. Documentation 12 (1596) 231-234.
21. P. Erdös, P. Frankl, Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel J. Math. 51 (1985) 79-89.
22. P. Erdös, J. Spencer, Probabilistic Methods in Combinatorics, Academic Press, New York, 1974.
23. M. Sobel, P.A. Groll, Group testing to eliminate efficiently all defectives in a binomial sample, Bell System Tech. J. 28 (1959) 1179-1252.
24. J.K. Wolf, Born again group testing: Multiaccess communications, IEEE Trans. Inform. Theory IT-31 (1985) 185-191.