Improved algorithms for group testing with inhibitors

DOI10.1016/S0020-0190(98)00088-XzbMath1337.92009OpenAlexW2089214036MaRDI QIDQ293316

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

combinatorial problemscover-free familiesgroup testing

Mathematics Subject Classification ID

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

Related Items (10)

Exact learning from an honest teacher that answers membership queries ⋮ The identification of positive clones in a general inhibitor model ⋮ On parallel attribute-efficient learning. ⋮ 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 ⋮ Pooling designs for clone library screening in the inhibitor complex model ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ Threshold Group Testing

Cites Work

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

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