Sets pooling designs
From MaRDI portal
Publication:1306748
DOI10.1007/BF01609879zbMath0932.05018MaRDI QIDQ1306748
Publication date: 13 March 2000
Published in: Annals of Combinatorics (Search for Journal in Brave)
asymptotic approximationadaptive designsgroup testingblock designextremal setspooling designpositive subsetsets pooling designs
Design of statistical experiments (62K99) Hypergraphs (05C65) Combinatorial probability (60C05) Other designs, configurations (05B30)
Related Items
Almost Optimal Cover-Free Families ⋮ Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs ⋮ A group testing method for finding patterns in data ⋮ Exact learning from an honest teacher that answers membership queries ⋮ A competitive algorithm in searching for many edges in a hypergraph ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Hypothesis group testing for disjoint pairs ⋮ Locating and detecting arrays for interaction faults ⋮ A survey on nonadaptive group testing algorithms through the angle of decoding ⋮ Unnamed Item ⋮ Non-adaptive learning of a hidden hypergraph ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ An adaptive algorithm for group testing for complexes ⋮ Almost cover-free codes and designs ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Learning a hidden uniform hypergraph ⋮ Threshold and Majority Group Testing ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ A class of error-correcting pooling designs over complexes ⋮ Pooling designs for clone library screening in the inhibitor complex model ⋮ Reconstruction of hidden graphs and threshold group testing ⋮ Quaternary splitting algorithm in group testing ⋮ ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES ⋮ Non-adaptive Learning of a Hidden Hypergraph
Cites Work
