Threshold and Majority Group Testing

DOI10.1007/978-3-642-36899-8_24MaRDI QIDQ4915253zbMATH OpenOpenAlexFDO

Authors Christian Deppe, Vladimir Lebedev, Rudolf Ahlswede

Publication date 9 April 2013

Published in Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36899-8_24

zbMATH Keywords

cover-free codesgroup testingpoolingseparating codesthreshold group testing

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial codes (94B25)

Recommendations

• Threshold Group Testing
• Threshold group testing with consecutive positives
• Group testing with proximate dominating criteria
• scientific article; zbMATH DE number 3980896
• Optimal group testing
• Information-theoretic and algorithmic thresholds for group testing
• Information-Theoretic and Algorithmic Thresholds for Group Testing
• Subquadratic non-adaptive threshold group testing
• Subquadratic non-adaptive threshold group testing
• Group Testing With Probabilistic Tests: Theory, Design and Application

Cites work

• An upper bound of the number of tests in pooling designs for the error-tolerant complex model
• Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
• Density-based group testing
• Families of finite sets in which no intersection of sets is covered by the union of s others
• Finding one of D defective elements in some group testing models
• Generalized cover-free families.
• Guessing secrets
• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 2119669 (Why is no real title available?)
• Key storage in secure networks
• Nonadaptive algorithms for threshold group testing
• Nonrandom binary superimposed codes
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Reconstruction of hidden graphs and threshold group testing
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Separating codes and a new combinatorial search model
• Sets pooling designs
• Some new bounds for cover-free families
• Superimposed codes and threshold group testing
• Threshold Group Testing

Cited in

(10)

• A class of asymptotically optimal group testing strategies to identify good items
• On optimal randomized group testing with one defective item and a constrained number of positive responses
• A class of asymptotically optimal group screening strategies with limited item participation
• An improved zig zag approach for competitive group testing
• Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing
• Superimposed codes and threshold group testing
• Randomized Post-optimization for t-Restrictions
• The threshold for subgroup profiles to agree is \Omega(\log n)
• Threshold Group Testing
• Subquadratic non-adaptive threshold group testing

This page was built for publication: Threshold and Majority Group Testing

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