Efficient algorithms for chemical threshold testing problems

DOI10.1016/S0304-3975(00)00037-2MaRDI QIDQ5941290zbMATH OpenFDO

Authors A. D. Bonis, Luisa Gargano, Ugo Vaccaro

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(00)00037-2

zbMATH Keywords

group testingsearch algorithmsunbounded search

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1222826
• Threshold Group Testing
• Nonadaptive algorithms for threshold group testing
• Subquadratic non-adaptive threshold group testing
• Subquadratic non-adaptive threshold group testing

Cites work

• A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory
• A Sequential Method for Screening Experimental Variables
• An almost optimal algorithm for unbounded searching
• Born again group testing: Multiaccess communications
• Competitive group testing
• Group testing with unreliable tests
• scientific article; zbMATH DE number 910893 (Why is no real title available?)
• scientific article; zbMATH DE number 956611 (Why is no real title available?)
• Improved algorithms for group testing with inhibitors
• Modifications of Competitive Group Testing
• Nonrandom binary superimposed codes

Cited in

(4)

• Operations research applications of dichotomous search
• scientific article; zbMATH DE number 1222826 (Why is no real title available?)
• Density-based group testing
• An efficient algorithm for chemical fingerprinting

This page was built for publication: Efficient algorithms for chemical threshold testing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941290)