Efficient Two-Stage Group Testing Algorithms for Genetic Screening

TL;DR

This paper introduces new combinatorial designs for two-stage group testing algorithms that significantly reduce the number of individual tests needed in large-scale genetic screening and biological testing.

Contribution

It presents novel infinite classes of combinatorial constructions that optimize the second stage of two-stage disjunctive testing procedures, building on prior theoretical work.

Findings

New combinatorial classes for two-stage testing

Reduced number of individual tests in genetic screening

Enhanced efficiency in large-scale biological testing

Abstract

Efficient two-stage group testing algorithms that are particularly suited for rapid and less-expensive DNA library screening and other large scale biological group testing efforts are investigated in this paper. The main focus is on novel combinatorial constructions in order to minimize the number of individual tests at the second stage of a two-stage disjunctive testing procedure. Building on recent work by Levenshtein (2003) and Tonchev (2008), several new infinite classes of such combinatorial designs are presented.