  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.
