On optimal nested group testing algorithms
From MaRDI portal
Publication:1262065
DOI10.1016/0378-3758(90)90039-WzbMath0685.62081OpenAlexW1965618047MaRDI QIDQ1262065
Publication date: 1990
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(90)90039-w
individual testinggroup testingexplicit algorithmalphabetic treecontaminated setoptimal nested algorithmpairwise testing algorithmsingle defective
Applications of statistics in engineering and industry; control charts (62P30) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
An optimal strategy for sequential classification on partially ordered sets ⋮ A combinatorial approach to Golomb forests ⋮ Sequential Classification on Partially Ordered Sets ⋮ Huffman-type codes for infinite source distributions ⋮ Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness
Cites Work
- Optimal partitions of finite populations for Dorfman-type group testing
- On the Detection of Defective Members of Large Populations
- An Optimal Search Procedure
- The cutoff point for group testing
- Born again group testing: Multiaccess communications
- A Fundamental Monotonicity in Group Testing
- Some Completeness Results on Decision Trees and Group Testing
- An Optimum Nested Procedure in Binomial Group Testing
- The Exact Solution to the Two-Stage Group-Testing Problem
- On Finding a Single Defective in Binomial Group Testing
- Finding a Single Defective in Binomial Group-Testing
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
This page was built for publication: On optimal nested group testing algorithms