Nonadaptive algorithms for threshold group testing

DOI10.1016/j.dam.2008.06.003zbMath1186.68436OpenAlexW2044319540WikidataQ60962383 ScholiaQ60962383MaRDI QIDQ1028130

Hung-Lin Fu, Hong-Bin Chen

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.003

zbMATH Keywords

graph searchthreshold group testingnonadaptive algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Improved constructions for non-adaptive threshold group testing ⋮ Separating codes and a new combinatorial search model ⋮ Threshold group testing with consecutive positives ⋮ Threshold and Majority Group Testing ⋮ Superimposed Codes and Threshold Group Testing ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ Bounds on the rate of disjunctive codes ⋮ Reconstruction of hidden graphs and threshold group testing ⋮ Subquadratic non-adaptive threshold group testing

Cites Work

• Unnamed Item
• Unnamed Item
• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• An upper bound of the number of tests in pooling designs for the error-tolerant complex model
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Generalized cover-free families.
• Some new bounds for cover-free families
• An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
• On optimal superimposed codes
• Learning a Hidden Matching
• Learning a Hidden Subgraph
• Nonrandom binary superimposed codes
• Threshold Group Testing
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Nonadaptive algorithms for threshold group testing