Improved algorithms for group testing with inhibitors

DOI10.1016/S0020-0190(98)00088-XMaRDI QIDQ293316zbMATH OpenOpenAlexFDO

Authors Annalisa De Bonis, Ugo Vaccaro

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S002001909800088X?np=y

zbMATH Keywords

group testingcombinatorial problemscover-free families

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General biology and biomathematics (92B05) Algorithms on strings (68W32)

Recommendations

• New combinatorial structures with applications to efficient group testing with inhibitors
• Optimal Two-Stage Algorithms for Group Testing Problems
• scientific article; zbMATH DE number 2038701
• Efficient group testing algorithms with a constrained number of positive responses
• An efficient algorithm for combinatorial group testing

Cites work

• scientific article; zbMATH DE number 4064918 (Why is no real title available?)
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 65702 (Why is no real title available?)
• scientific article; zbMATH DE number 1222826 (Why is no real title available?)
• scientific article; zbMATH DE number 3801449 (Why is no real title available?)
• scientific article; zbMATH DE number 910893 (Why is no real title available?)
• scientific article; zbMATH DE number 1406785 (Why is no real title available?)
• A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory
• A Sequential Method for Screening Experimental Variables
• A parallel algorithm for nearly optimal edge search
• An almost optimal algorithm for unbounded searching
• Born again group testing: Multiaccess communications
• Competitive group testing
• Families of finite sets in which no set is covered by the union of two others
• Group testing with unreliable tests
• Locality based graph coloring
• Modifications of Competitive Group Testing
• Nonrandom binary superimposed codes
• On the upper bound of the size of the \(r\)-cover-free families
• Search problems for two irregular coins with incomplete feedback: The underweight model
• Visual cryptography for general access structures

Cited in

(12)

• Pooling designs for clone library screening in the inhibitor complex model
• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• Exact learning from an honest teacher that answers membership queries
• scientific article; zbMATH DE number 1222826 (Why is no real title available?)
• Sublinear decoding schemes for non-adaptive group testing with inhibitors
• The identification of positive clones in a general inhibitor model
• A survey on nonadaptive group testing algorithms through the angle of decoding
• New combinatorial structures with applications to efficient group testing with inhibitors
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• Efficient algorithms for chemical threshold testing problems
• Threshold Group Testing
• On parallel attribute-efficient learning.

This page was built for publication: Improved algorithms for group testing with inhibitors

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