Efficient Two-Stage Group Testing Algorithms for DNA Screening

TL;DR

This paper develops new combinatorial structures to optimize two-stage group testing algorithms, significantly reducing the number of individual tests needed in DNA screening processes.

Contribution

It introduces novel infinite classes of combinatorial structures crucial for minimizing tests in two-stage disjunctive group testing algorithms.

Findings

New infinite classes of combinatorial structures constructed.

Reduced number of individual tests in DNA screening.

Enhanced efficiency of two-stage group testing algorithms.

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.