2000 character limit reached
Efficient Two-Stage Group Testing Algorithms for DNA Screening
Published 18 Jun 2011 in cs.DM, cs.CE, cs.DS, cs.IT, math.CO, math.IT, and q-bio.QM | (1106.3680v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.