New combinatorial structures with applications to efficient group testing with inhibitors

DOI10.1007/s10878-007-9085-1zbMath1194.05009OpenAlexW2031332595WikidataQ60962384 ScholiaQ60962384MaRDI QIDQ2426666

Annalisa De Bonis

Publication date: 23 April 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9085-1

zbMATH Keywords

pooling designssuperimposed codescomputational molecular biologyselectorsgroup testing algorithms

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Channel models (including quantum) in information and communication theory (94A40)

Related Items (4)

Non-adaptive complex group testing with multiple positive sets ⋮ An extension of Stein-Lovász theorem and some of its applications ⋮ Non-adaptive Complex Group Testing with Multiple Positive Sets ⋮ Group Testing with Multiple Mutually-Obscuring Positives

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved algorithms for group testing with inhibitors
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Families of finite sets in which no set is covered by the union of \(r\) others
• On the ratio of optimal integral and fractional covers
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Some new bounds for cover-free families
• A Sequential Method for Screening Experimental Variables
• Born again group testing: Multiaccess communications
• Optimal Two-Stage Algorithms for Group Testing Problems
• Nonrandom binary superimposed codes

This page was built for publication: New combinatorial structures with applications to efficient group testing with inhibitors