Structure-aware combinatorial group testing: a new method for pandemic screening
From MaRDI portal
Publication:2169949
Cites work
- Bayesian Methods for Predicting Interacting Protein Pairs Using Domain Information
- Constructions of 2-cover-free families and related separating hash families
- Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families
- Embedding cover-free families and cryptographical applications
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Families of finite sets in which no set is covered by the union of \(r\) others
- scientific article; zbMATH DE number 1508646 (Why is no real title available?)
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- Linear Time Constructions of Some d-Restriction Problems
- Locating modifications in signed data for partial data integrity
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Low-weight superimposed codes and their applications
- Maximally Efficient Two‐Stage Screening
- Modification tolerant signature schemes: location and correction
- Nested cover-free families for unbounded fault-tolerant aggregate signatures
- Nonrandom binary superimposed codes
- On r-cover-free families
- On the upper bound of the size of the \(r\)-cover-free families
- Optimal configuration of a square array group testing algorithm
- Three-Dimensional Array-Based Group Testing Algorithms
Cited in
(3)
This page was built for publication: Structure-aware combinatorial group testing: a new method for pandemic screening
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169949)
