Improved algorithms for chemical threshold testing problems

DOI10.1007/3-540-68535-9_16MaRDI QIDQ4218414zbMATH OpenFDO

Authors Annalisa De Bonis, Luisa Gargano, Ugo Vaccaro

Publication date 11 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68535-9_16

zbMATH Keywords

group testing problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Efficient algorithms for chemical threshold testing problems
• An efficient algorithm for chemical fingerprinting
• An efficient algorithm for batch stability testing
• Improved algorithms for group testing with inhibitors
• Improved testing algorithms for monotonicity
• An improved algorithm for quantitative group testing
• scientific article; zbMATH DE number 1241449
• Improved approximation of linear threshold functions
• Improved algorithms via approximations of probability distributions
• Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes

Cited in

(4)

• New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach
• Improved algorithms for group testing with inhibitors
• Efficient algorithms for chemical threshold testing problems
• An efficient algorithm for chemical fingerprinting

This page was built for publication: Improved 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 Q4218414)