Explicit non-adaptive combinatorial group testing schemes

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 748-759

  Porat, Ely ^a   Rothschild, Amir ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SUPPORT VECTOR MACHINES; TRANSLATION (LANGUAGES);

COMBINATORIAL GROUP TESTING; COMBINATORICS; EXPLICIT CONSTRUCTIONS; GROUP TESTING;

LINGUISTICS;

EID: 49149086879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_61     Document Type: Conference Paper

References (55)

1. The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS): DIMACS Workshop on Combinatorial Group Testing, The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) (May 2006)
2. Dorfman, R.: The detection of defective members of large populations. The Annals of Mathematical Statistics 14(4), 436-440 (1943)
3. Barillot, E., Lacroix, B., Cohen, D.: Theoretical analysis of library screening using an n- dimensional pooling strategy. Nucleic Acids Research, 6241-6247 (1991)
4. Bruno, W., Balding, D., Knill, E., Bruce, D., Whittaker, C., Dogget, N., Stalling, R., Torney, D.: Design of efficient pooling experiments. Genomics 26, 21-30 (1995)
5. T., B., J.W., M., P., S.: Maximally efficient two-stage screening. Biometrics 56(8), 833-840 (2000)
6. Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: k-mismatch with don't cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 151-162. Springer, Heidelberg (2007)
7. Amir, A., Kapah, O., Porat, E.: Deterministic length reduction: Fast convolution in sparse data and applications. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 183-194. Springer, Heidelberg (2007)
8. Cormode, G., Muthukrishnan, S.: What's hot and what's not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30(1), 249-278 (2005)
9. Porat, B., Porat, E., Rothschild, A.: Pattern matching in a streaming model
10. Muthukrishnan, S.: Some algorithmic problems and results in compressed sensing. In: 44th Allerton Conference on Communication, Control and Computing (2006)
11. Indyk, P.: Explicit constructions for compressed sensing of sparse signals. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (2008)
12. Gilbert, A.C., Strauss, M.J., Tropp, J.A., Vershynin, R.: One sketch for all: fast algorithms for compressed sensing. In: STOC 2007: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 237-246. ACM, New York (2007)
13. Cormode, G., Muthukrishnan, S.: Combinatorial algorithms for compressed sensing. In: Flocchini, P., Gasieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 280-294. Springer, Heidelberg (2006)
14. Iwen, M.A.: A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods. CoRR abs/0708.1211 (2007)
15. Sobel, M., Groll, P.: Group testing to eliminate efficiently all defectives in a binomial sample. Bell Syst. Tech. J. 38, 1179-1252 (1959)
16. Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Transaction of Information Theory 10, 363-377 (1964)
17. Li, C.: A sequential method for screening experimental variables. J. Amer. Sta. Assoc. 57, 455-477 (1962)
18. Wolf, J.: Born again group testing: Multiaccess communications. IEEE Transactions on Information Theory 31(2), 185-191 (1985)
19. Hong, E., Ladner, R.: Group testing for image compression. In: Data Compression Conference, pp. 3-12 (2000)
20. Blass, A., Gurevich, Y.: Pairwise testing. Bulletin of the EATCS 78, 100-132 (2002)
21. Cohen, D., Dalal, S., Fredman, M., Patton, G.: The AETG system: An approach to testing based on combinatiorial design. Software Engineering 23(7), 437-444 (1997)
22. Pevzner, P.A., Lipshutz, R.J.: Towards dna sequencing chips. In: MFCS 1994: Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994, London, UK. LNCS, pp. 143-158. Springer, Heidelberg (1994)
23. Du, D., Hwang, F.: Combinatorial Group Testing and its Applications, 2nd edn. Series on Applied Mathematics, vol. 12. World Scientific, Singapore (2000)
24. Farach, M., Kannan, S., Knill, E., Muthukrishnan, S.: Group testing problems with sequences in experimental molecular biology. In: The Compression and Complexity of Sequences 1997, p. 357 (1997)
25. Ngo, H., Du, D.: A survey on combinatorial group testing algorithms with applications to DNA library screening. In: DIMACS Series Discrete Math. and Theor. Computer Science vol. 55, pp. 171-182. AMS (2000)
26. Balding, D.J., Bruno, W.J., Knill, E., Torney, D.C.: A comparative survey of nonadaptive pooling designs. Institute for Mathematics and Its Applications 81, 133 (1996)
27. Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: ACM Symposium on Theory of Computing (STOC), pp. 30-36 (1996)
28. Gilbert, E.: A comparison of signalling alphabets. Bell System Technical Journal 31, 504-522 (1952)
29. Varshamov, R.: Estimateof the number of signals in error correcting codes. Doklady Akadamii Nauk 117, 739-741 (1957)
30. Brualdi, R.A., Pless, V.: Greedy codes. J. Comb. Theory, Ser. A 64(1), 10-30 (1993)
31. Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: IEEE Symposium on Foundations of Computer Science, pp. 575-581 (2000)
32. Knill: Lower bounds for identifying subset members with subset queries. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms) (1995)
33. Bonis, A.D., Gasieniec, L., Vaccaro, U.: Generalized framework for selectors with applications in optimal group testing. In: ICALP, pp. 81-96 (2003)
34. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: SODA, pp. 709-718 (2001)
35. Bonis, A.D., Vaccaro, U.: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theor. Comput. Sci. 306(1-3), 223-243 (2003)
36. Bonis, A.D., Gasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253-1270 (2005)
37. Farach, M., Kannan, S., Knill, E., Muthukrishnan, S.: Group testing problems with sequences in experimental molecular biology. In: SEQUENCES 1997: Proceedings of the Compression and Complexity of Sequences 1997, Washington, DC, USA, p. 357. IEEE Computer Society, Los Alamitos (1997)
38. Damaschke, P.: Randomized group testing for mutually obscuring defectives. Inf. Process. Lett. 67(3), 131-135 (1998)
39. Bonis, A.D., Vaccaro, U.: Improved algorithms for group testing with inhibitors. Inf. Process. Lett. 67(2), 57-64 (1998)
40. Berger, T., Levenshtein, V.I.: Asymptotic efficiency of two-stage disjunctive testing. IEEE Transactions on Information Theory 48(7), 1741-1749 (2002)
41. Berger, T., Levenshtein, V.I.: Application of cover-free codes and combinatorial designs to two-stage testing. Discrete Appl. Math. 128(1), 11-26 (2003)
42. A.J., M.: Probabilistic nonadaptive and two-stage group testing with relatively small pools and Dna library screening. Journal of Combinatorial Optimization 2, 385-397 (1998)
43. Knill, E., Bruno, W.J., Torney, D.C.: Non-adaptive group testing in the presence of errors. Discrete Applied Mathematics 88(1-3), 261-290 (1998)
44. Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for - restrictions. ACM Transactions on Algorithms 2(2), 153-177 (2006)
45. Wozencraft, J.: Threshold decoding. Personal communication in [55] section 2.5 (1963)
46. Goppa, V.: Codes associated with divisors. Problems of Information Transmission 13(1), 22-26 (1977)
47. Tsfasman, M., Vladut, S., Zink, T.: Modular curves, Shimura curves, and codes better then the Varshamov-Gilbert bound. Math. Nachrichten 109, 21-28 (1982)
48. Shum, K.: A Low-Complexity Construction of Algebric Geometry Codes Better Then the Gilbert-Varshamov Bound. PhD thesis, University of Southern California (December 2000)
49. Shum, K., Aleshnikov, I., Kumar, P., Stichtenoth, H., Deolalikar, V.: A low-complexity algorithm for the construction of algebraic geometric codes better then the Gilbert-Varshamov bound. IEEE Transaction on Information Theory 47(6), 2225-2241 (2001)
50. Cheraghchi, M., Shokrollahi, A., Wigderson, A.: Computational Hardness and Explicit Constructions of Error Correcting Codes. In: 44th Allerton Conference on Communication, Control and Computing (2006)
51. Porat, E., Rothschild, A.: Explicit non-adaptive combinatorial group testing schemes. CoRR abs/0712.3876 (2007)
52. Clementi, A., Monti, A., Silvestri, R.: Distributed broadcast in radio networds of unknown topology. Theoretical Computer Science 302(1-3), 337-364 (2003)
53. Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. John Wiley and Sons Inc., Chichester (2001)
54. Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301), 13-30 (1963)
55. Massey, J.L.: Threshold decoding. MIT Press, Cambridge (1963)