Noise-resilient group testing: Limitations and constructions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5699 LNCS, Issue , 2009, Pages 62-73

  Cheraghchi, Mahdi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE MEASUREMENTS; BOOLEAN VECTORS; COMBINATORIAL GROUP TESTING; EFFICIENT RECONSTRUCTION; EXPLICIT CONSTRUCTIONS; FALSE NEGATIVES; FALSE POSITIVE; GROUP TESTING; NOISE MODELS; SPARSE VECTORS; SUBLINEAR;

COMPUTATION THEORY;

VECTORS;

EID: 70350639446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03409-1_7     Document Type: Conference Paper

References (22)

1. Du, D.Z., Hwang, F.: Combinatorial Group Testing and its Applications, 2nd edn. World Scientific, Singapore (2000)
2. Du, D.-Z., Hwang, F.K.: Pooling Designs and Nonadaptive Group Testing. World Scientific, Singapore (2006)
3. Knill, E.: Lower bounds for identifying subset members with subset queries. In: Proceedings of SODA, pp. 369-377 (1995)
4. Dyachkov, A., Rykov, V.: A survey of superimposed code theory. Problems of Control and Information Theory 12(4), 229-242 (1983)
5. Knill, E., Bruno, W.J., Torney, D.C.: Non-adaptive group testing in the presence of errors. Discrete Appl. Math. 88(1-3), 261-290 (1998)
6. D'yachkov, A.G., Rykov, V.: Bounds of the length of disjunct codes. Problems of Control and Information Theory 11, 7-13 (1982)
7. Ruszinkó: On the upper bound of the size of the r-cover-free families. J. Comb. Theory., Series A 66, 302-310 (1994)
8. Füredi, Z.: On r-cover-free families. J. Comb. Theory, Series A 73, 172-173 (1996)
9. Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Transactions on Information Theory 10, 363-377 (1964)
10. Macula, A.: Probabilistic nonadaptive and two-stage group testing with relatively small pools and DNA library screening. J. Comb. Optim. 2, 385-397 (1999)
11. Berger, T., Mandell, J., Subrahmanya, P.: Maximally efficient two-stage group testing. Biometrics 56, 833-840 (2000)
12. De Bonis, A., Gasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM Journal on Computing 34(5), 1253-1270 (2005)
13. Eppstein, D., Goodrich, M., Hirschberg, D.: Improved combinatorial group testing algorithms for real-world problem sizes. SIAM J. Comp. 36(5), 1360-1375 (2007)
14. Cheng, Y., Du, D.Z.: New constructions of one- and two-stage pooling designs. Journal of Computational Biology 15(2), 195-205 (2008)
15. Indyk, P.: Explicit constructions of selectors with applications. In: Proceedings of SODA (2002)
16. Chlebus, B., Kowalski, D.: Almost optimal explicit selectors. In: Li'skiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 270-280. Springer, Heidelberg (2005)
17. Ta-Shma, A., Zuckerman, D.: Extractor codes. IEEE Transactions on Information Theory 50(12), 3015-3025 (2004)
18. Guruswami, V., Umans, C., Vadhan, S.: Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In: Proc. of the 22nd IEEE CCC (2007)
19. Radhakrishan, J., Ta-Shma, A.: Tight bounds for depth-two superconcentrators. In: Proceedings of the 38th FOCS, pp. 585-594 (1997)
20. Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A.: Randomness conductors and constant-degree expansion beyond the degree/2 barrier. In: Proceedings of the 34th STOC, pp. 659-668 (2002)
21. Trevisan, L.: Extractors and pseudorandom generators. Journal of the ACM 48(4), 860-879 (2001)
22. Raz, R., Reingold, O., Vadhan, S.: Extracting all the randomness and reducing the error in Trevisan's extractor. JCSS 65(1), 97-128 (2002)