منابع مشابه
Multilevel Group Testing via Sparse-graph Codes
In this paper, we consider the problem of multilevel group testing, where the goal is to recover a set of K defective items in a set of n items by pooling groups of items and observing the result of each test. The main difference of multilevel group testing with the classical non-adaptive group testing problem is that the result of each test is an integer in the set [L] = {0, 1, · · · , L}: if ...
متن کاملConstrained Group Testing to Predict Binding Response of Candidate Compounds
We study the problem of identifying reactive compound(s) in a solution as e ciently as possible, with the goal of minimizing the number of chemical tests required to make exact identification. The area of group testing is appropriate for this problem, except that most group testing approaches assume that arbitrary tests can be performed, which is not the case in our application. To address this...
متن کاملGroup Testing using left-and-right-regular sparse-graph codes
We consider the problem of non-adaptive group testing of N items out of which K or less items are known to be defective. We propose a testing scheme based on left-andright-regular sparse-graph codes and a simple iterative decoder. We show that for any arbitrarily small ǫ > 0 our scheme requires only m = cǫK log c1N K tests to recover (1− ǫ) fraction of the defective items with high probability ...
متن کاملGraph Isomorphism Testing Without Full Automorphism Group Computation∗
In this paper we present an algorithm for testing the isomorphism of two graphs. The algorithm works in three steps. First, it builds a sequence of partitions on the vertices of one of the graphs. Then, it looks for some automorphisms in that graph. Finally, it uses backtracking to try to find another sequence of partitions for the second graph that is compatible with that for the first graph. ...
متن کاملLanguage Constrained Graph Problems
This paper starts by discussing an algorithmic view of labeled path problems. In particular, we apply Seidel’s all-pairs shortest-path algorithm for undirected and unweighted graphs to a basic problem in labeled paths. Seidel’s algorithm is applied to find unlabeled paths between any pairs of nodes in a labeled graph whose associated context-free grammar G can generate the empty string . Our re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2012
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2169535