375 research outputs found

    Efficient (nonrandom) construction and decoding for non-adaptive group testing

    Full text link
    The task of non-adaptive group testing is to identify up to dd defective items from NN items, where a test is positive if it contains at least one defective item, and negative otherwise. If there are tt tests, they can be represented as a t×Nt \times N measurement matrix. We have answered the question of whether there exists a scheme such that a larger measurement matrix, built from a given t×Nt\times N measurement matrix, can be used to identify up to dd defective items in time O(tlog2N)O(t \log_2{N}). In the meantime, a t×Nt \times N nonrandom measurement matrix with t=O(d2log22N(log2(dlog2N)log2log2(dlog2N))2)t = O \left(\frac{d^2 \log_2^2{N}}{(\log_2(d\log_2{N}) - \log_2{\log_2(d\log_2{N})})^2} \right) can be obtained to identify up to dd defective items in time poly(t)\mathrm{poly}(t). This is much better than the best well-known bound, t=O(d2log22N)t = O \left( d^2 \log_2^2{N} \right). For the special case d=2d = 2, there exists an efficient nonrandom construction in which at most two defective items can be identified in time 4log22N4\log_2^2{N} using t=4log22Nt = 4\log_2^2{N} tests. Numerical results show that our proposed scheme is more practical than existing ones, and experimental results confirm our theoretical analysis. In particular, up to 27=1282^{7} = 128 defective items can be identified in less than 1616s even for N=2100N = 2^{100}

    A framework for generalized group testing with inhibitors and its potential application in neuroscience

    Get PDF
    The main goal of group testing with inhibitors (GTI) is to efficiently identify a small number of defective items and inhibitor items in a large set of items. A test on a subset of items is positive if the subset satisfies some specific properties. Inhibitor items cancel the effects of defective items, which often make the outcome of a test containing defective items negative. Different GTI models can be formulated by considering how specific properties have different cancellation effects. This work introduces generalized GTI (GGTI) in which a new type of items is added, i.e., hybrid items. A hybrid item plays the roles of both defectives items and inhibitor items. Since the number of instances of GGTI is large (more than 7 million), we introduce a framework for classifying all types of items non-adaptively, i.e., all tests are designed in advance. We then explain how GGTI can be used to classify neurons in neuroscience. Finally, we show how to realize our proposed scheme in practice

    Noise-Resilient Group Testing: Limitations and Constructions

    Full text link
    We study combinatorial group testing schemes for learning dd-sparse Boolean vectors using highly unreliable disjunctive measurements. We consider an adversarial noise model that only limits the number of false observations, and show that any noise-resilient scheme in this model can only approximately reconstruct the sparse vector. On the positive side, we take this barrier to our advantage and show that approximate reconstruction (within a satisfactory degree of approximation) allows us to break the information theoretic lower bound of Ω~(d2logn)\tilde{\Omega}(d^2 \log n) that is known for exact reconstruction of dd-sparse vectors of length nn via non-adaptive measurements, by a multiplicative factor Ω~(d)\tilde{\Omega}(d). Specifically, we give simple randomized constructions of non-adaptive measurement schemes, with m=O(dlogn)m=O(d \log n) measurements, that allow efficient reconstruction of dd-sparse vectors up to O(d)O(d) false positives even in the presence of δm\delta m false positives and O(m/d)O(m/d) false negatives within the measurement outcomes, for any constant δ<1\delta < 1. We show that, information theoretically, none of these parameters can be substantially improved without dramatically affecting the others. Furthermore, we obtain several explicit constructions, in particular one matching the randomized trade-off but using m=O(d1+o(1)logn)m = O(d^{1+o(1)} \log n) measurements. We also obtain explicit constructions that allow fast reconstruction in time \poly(m), which would be sublinear in nn for sufficiently sparse vectors. The main tool used in our construction is the list-decoding view of randomness condensers and extractors.Comment: Full version. A preliminary summary of this work appears (under the same title) in proceedings of the 17th International Symposium on Fundamentals of Computation Theory (FCT 2009
    corecore