Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach
نویسندگان
چکیده
منابع مشابه
Adaptive Group Testing Algorithms to Estimate the Number of Defectives
We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower bound that show that, for constant estimation, the number of tests in our algorithm is optimal.
متن کاملNoisy Adaptive Group Testing: Bounds and Algorithms
The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern matching, and many more. One of the defining features of the group testing problem is the distinction between the non-adaptive and adaptive settings: In the...
متن کاملOn Group Testing with a Bounded Number of Defectives
The seminary was concerned with questions arising in computing when the inputs to the computation can be corrupted. Such studies have implications for the manipulation, retrieval and transmission in the presence of errors and noise and they are related to many fields in Computer Science, Mathematics and Information Theory. Important technical tools come, e. g., from combinatorial search theory ...
متن کاملNon-Adaptive Group Testing on Graphs
Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem of learning a hidden graph for some especial cases, such as hamiltonian cycle, cliques, stars, and matchings. This problem is motivated by problems in chemical reactions, molecular biology and genome sequencing. In this paper, we present a generalization of this problem. Precisely, we consider a graph G and a subgraph H...
متن کاملNon-Adaptive Randomized Algorithm for Group Testing
We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independently from {0, 1} with a fixed probability p. The property that is sufficient and necessary for a unique decoding is the separability of the tests, but unfortunately no linear time algorithm is known for such tests. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2970184