Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes

Details Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes

2005-05-18

arxiv.org/abs/cs/0505048v1

SIAM J. Computing 36(5):1360-1375, 2007

Computer Science

Data Structures and Algorithms

18 pages; an abbreviated version of this paper is to appear at the 9th Worksh. Algorithms and Data Structures

Scientific paper

10.1137/050631847

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.

Affiliated with

Also associated with

No associations

Rating

Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581863