Improved combinatorial group testing for real-world problem sizes

Authors:
David Eppstein;Michael T. Goodrich;Daniel S. Hirschberg
Affiliations:
Dept. of Computer Science, Univ. of California, Irvine, CA;Dept. of Computer Science, Univ. of California, Irvine, CA;Dept. of Computer Science, Univ. of California, Irvine, CA
Venue:
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Year:
2005

Citing 7
Cited 4

On the upper bound of the size of the r-cover-free families

Journal of Combinatorial Theory Series A
Randomized algorithms

Randomized algorithms
Algorithmic number theory

Algorithmic number theory
The kth prime is greater than k(lnk + ln lnk - 1) for k ≥ 2

Mathematics of Computation
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Group Testing Problems with Sequences in Experimental Molecular Biology

SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Generalized framework for selectors with applications in optimal group testing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Efficient parallel algorithms for dead sensor diagnosis and multiple access channels

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors

Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
Adjacent link failure localization with monitoring trails in all-optical mesh networks

IEEE/ACM Transactions on Networking (TON)
Space-efficient straggler identification in round-trip data streams via newton's identities and invertible bloom filters

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the number of tests in a combinatorial group testing regimen.