Efficient Two-Stage Group Testing Algorithms for DNA Screening

Details Efficient Two-Stage Group Testing Algorithms for DNA Screening Efficient Two-Stage Group Testing Algorithms for DNA Screening

2011-06-18

arxiv.org/abs/1106.3680v1

Computer Science

Discrete Mathematics

12 pages; accepted for ICALP 2011 Group Testing Workshop: Algorithms and Data Structures for selection, identification and enc

Scientific paper

Group testing algorithms are very useful tools for DNA library screening.
Building on recent work by Levenshtein (2003) and Tonchev (2008), we construct
in this paper new infinite classes of combinatorial structures, the existence
of which are essential for attaining the minimum number of individual tests at
the second stage of a two-stage disjunctive testing algorithm.

Affiliated with

Also associated with

No associations

Rating

Efficient Two-Stage Group Testing Algorithms for DNA Screening 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 Efficient Two-Stage Group Testing Algorithms for DNA Screening, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Two-Stage Group Testing Algorithms for DNA Screening will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466077