Structure-aware combinatorial group testing: a new method for pandemic screening
From MaRDI portal
Publication:2169949
DOI10.1007/978-3-031-06678-8_11OpenAlexW4285226679MaRDI QIDQ2169949
Lucia Moura, Thais Bardini Idalino
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2202.09264
Cites Work
- Unnamed Item
- Low-weight superimposed codes and their applications
- Families of finite sets in which no set is covered by the union of \(r\) others
- On the upper bound of the size of the \(r\)-cover-free families
- Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families
- On \(r\)-cover-free families
- Modification tolerant signature schemes: location and correction
- Nested cover-free families for unbounded fault-tolerant aggregate signatures
- Embedding cover-free families and cryptographical applications
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- Locating modifications in signed data for partial data integrity
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Optimal Configuration of a Square Array Group Testing Algorithm
- Three-Dimensional Array-Based Group Testing Algorithms
- Constructions of 2-cover-free families and related separating hash families
- Maximally Efficient Two‐Stage Screening
- Explicit Nonadaptive Combinatorial Group Testing Schemes
- Nonrandom binary superimposed codes
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
- Bayesian Methods for Predicting Interacting Protein Pairs Using Domain Information
This page was built for publication: Structure-aware combinatorial group testing: a new method for pandemic screening
