Finding one of D defective elements in some group testing models
نویسندگان
چکیده
In contrast to the classical goal of group testing, we consider the problem of finding m defective elements out of D (m ≤ D). We analyze two different test functions. We give adaptive strategies and present lower bounds for the number of tests and show that our strategy is optimal for m = 1. DOI: 10.1134/S0032946012020068
منابع مشابه
Group Testing with Multiple Mutually-Obscuring Positives
Group testing is a frequently used tool to identify an unknown set of defective (positive) elements out of a large collection of elements by testing subsets (pools) for the presence of defectives. Various models have been studied in the literature. The most studied case concerns only two types (defective and non-defective) of elements in the given collection. This paper studies a novel and natu...
متن کاملRandomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defective, and No if the subset is free of defectives. By the entropy lower bound, log2 ∑d
متن کاملConscious and controlling elements in combinatorial group testing problems with more defectives
In combinatorial group testing problems Questioner needs to find a defective element x ∈ [n] by testing subsets of [n]. In [18] the authors introduced a new model, where each element knows the answer for those queries that contain it and each element should be able to identify the defective one. In this article we continue to investigate this kind of models with more defective elements. We also...
متن کاملDensity-Based Group Testing
In this paper we study a new, generalized version of the wellknown group testing problem. In the classical model of group testing we are given n objects, some of which are considered to be defective. We can test certain subsets of the objects whether they contain at least one defective element. The goal is usually to find all defectives using as few tests as possible. In our model the presence ...
متن کاملThe complexity of determinacy problem on group testing
Group testing was first discovered by Dorfman [l] when he did blood testing during World War II. Since then, one has found many applications in statistics, , combinatorics and computer science. The general form of the problem is as follows: Let N be a set of n items denoted by 1,2, . . . , n; some items are defective. We need to find out all defective items by a given kind of tests. What is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Probl. Inf. Transm.
دوره 48 شماره
صفحات -
تاریخ انتشار 2012