Construction of d(H)\,-\,disjunct matrix for group testing in hypergraphs
From MaRDI portal
Publication:2369987
Recommendations
- On almost disjunct matrices for group testing
- A group testing problem for hypergraphs of bounded rank
- New construction of a group testing model \((d, r, z]\)-disjunct matrix with error-tolerance
- Combinatorial group testing in bipartite graphs
- Trivial two-stage group testing for complexes using almost disjunct matrices.
- An optimal group testing algorithm on \(k\) disjoint sets
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- A tight upper bound for group testing in graphs
- Group testing in bipartite graphs
Cites work
Cited in
(13)- Pooling designs for clone library screening in the inhibitor complex model
- On the complexity and approximation of non-unique probe selection using \(d\)-disjunct matrix
- Strict group testing and the set basis problem
- Exact learning from an honest teacher that answers membership queries
- Almost optimal cover-free families
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Non-adaptive complex group testing with multiple positive sets
- The optimal number of items in a group for group testing
- Non-adaptive complex group testing with multiple positive sets
- An adaptive algorithm for group testing for complexes
- Non-adaptive learning of a hidden hypergraph
- Non-adaptive learning of a hidden hypergraph
This page was built for publication: Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369987)
