A Survey on Combinatorial Group Testing Algorithms with ...

← Back to document page

DIMACSSeriesinDiscreteMathematicsandTheo reticalComputerScienceA SurveyonCombinatorialGroupTestingAlgorit hmswithApplicationstoDNA TRACT. Inthispaper, wegive focusesonseveralclassesofconstructionsno tdiscussedinprevioussurveys,providesa (aDNAsegment)fromthelibrarycontainswhich probefroma saidtobepositivefora probeif it containstheprobe, ,sincecheckingeachclone-probepairis expensive andusuallyonlyafew clonescontainany whenSequenced-TaggedSitemarkers(alsocall edSTSprobes)areused[OHCB89].If thetestresultfora pool(ofclones)isnegative, indicatingthatnocloneinthepoolcontainsth eprobe, justaninstanceofthegeneralgrouptestingpr oblem,inwhicha largepopulationofitemscontaininga smallsetofdefectivesaretobetestedtoident ifythedefectivesefficiently.

gave a nice account of CGT algorithms. The third was an article by Balding et al. (1995, [BBKT96]), which comparatively surveyed certain classes of non-adaptive algorithms. In this paper, we give an overview of Combinatorial Group Testing algorithms with applications to DNA Library Screening. Our survey focuses on several classes of con-

  Applications, With, Testing, Group, Algorithm, Combinatorial, Combinatorial group testing algorithms with applications, On combinatorial group testing algorithms with