Efficient Two-Stage Group Testing Algorithms for DNA Screening
Discrete Mathematics
2011-06-21 v1 Computational Engineering, Finance, and Science
Data Structures and Algorithms
Information Theory
Combinatorics
math.IT
Quantitative Methods
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.
Keywords
Cite
@article{arxiv.1106.3680,
title = {Efficient Two-Stage Group Testing Algorithms for DNA Screening},
author = {Michael Huber},
journal= {arXiv preprint arXiv:1106.3680},
year = {2011}
}
Comments
12 pages; accepted for ICALP 2011 Group Testing Workshop: Algorithms and Data Structures for selection, identification and encoding (ICALP 2011 GT, Zurich)