Hypothesis group testing for disjoint pairs

Morgan A. Bishop (), Anthony J. Macula (), Thomas E. Renz () and Vladimir V. Ufimtsev ()
Additional contact information
Morgan A. Bishop: JEANSEE
Anthony J. Macula: SUNY Geneseo
Thomas E. Renz: IFTC, Rome Research Site
Vladimir V. Ufimtsev: IFTC, Rome Research Site

Journal of Combinatorial Optimization, 2008, vol. 15, issue 1, No 2, 7-16

Abstract: Abstract Classical group testing (CGT) is a widely applicable biotechnical technique used to identify a small number of distinguished objects from a population when the presence of any one of these distinguished objects among a group of others produces an observable result. This paper discusses a variant of CGT called group testing for disjoint pairs (GTAP). The difference between the two is that in GTDP, the distinguished items are pairs from, not individual objects in, the population. There are several biological examples of when this abstract model applies. One biological example is DNA hybridization. The presence of pairs of hybridized DNA strands can be detected in a pool of DNA strands. Another situation is the detection of binding interactions between prey and bait proteins. This paper gives a random pooling method, similar in spirit to hypothesis testing, which identifies pairs of objects from a population that collectively have an observable function. This method is simply to apply, achieves good results, is amenable to automation and can be easily modified to compensate for testing errors.

Keywords: Group testing; Complexes; Nonadaptive; Pooling; Random algorithms (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9081-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:15:y:2008:i:1:d:10.1007_s10878-007-9081-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9081-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().