Trivial Two-Stage Group Testing with High Error Rates

Anthony J. Macula ()
Additional contact information
Anthony J. Macula: State University of New York, College at Geneseo

Journal of Combinatorial Optimization, 2003, vol. 7, issue 4, No 4, 368 pages

Abstract: Abstract Given a population of cardinality q r that contains a positive subset P of cardinality p, we give a trivial two-stage method that has $${\text{(}}_2^{{\text{(}}r{\text{ + 1)}}q} ) - r(_2^q )$$ first stage pools each of which contains q r − 2 objects. We assume that errors occur in the first stage. We give an algorithm that uses the results of first stage to generate a set CP of candidate positives with |CP| ≤ (r + 1)q. We give the expected value of |CP∩P|. At most (r + 1)q trivial second stage tests are needed to identify all the positives in CP. We assume that the second stage tests are error free.

Keywords: group testing; two-stage algorithm; error-correcting; nonadaptive; non-adaptive (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000017384.94868.45 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:7:y:2003:i:4:d:10.1023_b:joco.0000017384.94868.45

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

DOI: 10.1023/B:JOCO.0000017384.94868.45

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 ().