Algorithmic construction of sets for k-restrictions
N Alon, D Moshkovitz, S Safra - ACM Transactions on Algorithms (TALG), 2006 - dl.acm.org
This work addresses k-restriction problems, which unify combinatorial problems of the
following type: The goal is to construct a short list of strings in Σ m that satisfies a given set of …
following type: The goal is to construct a short list of strings in Σ m that satisfies a given set of …
[图书][B] Pooling designs and nonadaptive group testing: important tools for DNA sequencing
FK Hwang, D Du - 2006 - books.google.com
Pooling designs have been widely used in various aspects of DNA sequencing. In biological
applications, the well-studied mathematical problem called “group testing” shifts its focus to …
applications, the well-studied mathematical problem called “group testing” shifts its focus to …
Optimal group testing
A Coja-Oghlan, O Gebhard… - … on Learning Theory, 2020 - proceedings.mlr.press
In the group testing problem, which goes back to the work of Dorfman (1943), we aim to
identify a small set of $ k\sim n^\theta $ infected individuals out of a population size $ n …
identify a small set of $ k\sim n^\theta $ infected individuals out of a population size $ n …
Optimal two-stage algorithms for group testing problems
A De Bonis, L Gasieniec, U Vaccaro - SIAM Journal on Computing, 2005 - SIAM
Group testing refers to the situation in which one is given a set of objects \calO, an unknown
subset \calP⊆\calO, and the task of determining \calP by asking queries of the type" does …
subset \calP⊆\calO, and the task of determining \calP by asking queries of the type" does …
Information-theoretic and algorithmic thresholds for group testing
A Coja-Oghlan, O Gebhard… - IEEE Transactions …, 2020 - ieeexplore.ieee.org
In the group testing problem we aim to identify a small number of infected individuals within
a large population. We avail ourselves to a procedure that can test a group of multiple …
a large population. We avail ourselves to a procedure that can test a group of multiple …
Saffron: A fast, efficient, and robust framework for group testing based on sparse-graph codes
Group testing is the problem of identifying K defective items among n items by pooling
groups of items. In this paper, we design group testing algorithms for approximate recovery …
groups of items. In this paper, we design group testing algorithms for approximate recovery …
Explicit non-adaptive combinatorial group testing schemes
E Porat, A Rothschild - International Colloquium on Automata, Languages …, 2008 - Springer
Group testing is a long studied problem in combinatorics: A small set of r ill people should be
identified out of the whole (n people) by using only queries (tests) of the form “Does set X …
identified out of the whole (n people) by using only queries (tests) of the form “Does set X …
Explicit nonadaptive combinatorial group testing schemes
E Porat, A Rothschild - IEEE Transactions on Information …, 2011 - ieeexplore.ieee.org
Group testing is a long studied problem in combinatorics: A small set of r ill people should be
identified out of the whole (n people) by using only queries (tests) of the form “Does set X …
identified out of the whole (n people) by using only queries (tests) of the form “Does set X …
On the optimality of the Kautz-Singleton construction in probabilistic group testing
We consider the probabilistic group testing problem where d random defective items in a
large population of N items are identified with high probability by applying binary tests. It is …
large population of N items are identified with high probability by applying binary tests. It is …
Efficiently decodable error-correcting list disjunct matrices and applications
Abstract A (d, ℓ)-list disjunct matrix is a non-adaptive group testing primitive which, given a
set of items with at most d “defectives,” outputs a superset of the defectives containing less …
set of items with at most d “defectives,” outputs a superset of the defectives containing less …