scientific article; zbMATH DE number 956611
zbMATH Open0860.62083MaRDI QIDQ5687002FDOQ5687002
Authors: William J. Bruno, Emanuel Knill, David C. Torney, David Joseph Balding 
Publication date: 16 April 1997
Title of this publication is not available (Why is that?)
Recommendations
poolingperformance measuresgroup testingrandom designstransversal designsrow and column designsdeterministic designslibrary of cloned segments of DNAmultiple screeningsnon-adaptive designsrandom incidence designsrandom k-set designsscreening clone librariesset-packing designs
Applications of statistics to biology and medical sciences; meta analysis (62P10) Protein sequences, DNA sequences (92D20)
Cited In (35)
- Asymptotics of pooling design performance
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Pooling, lattice square, and union jack designs
- Identifying defective network components through restricted group testing
- RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS
- Probabilistic nonadaptive group testing in the presence of errors and DNA library screening
- New constructions of non-adaptive and error-tolerance pooling designs
- Tracing a single user
- Using transforming matrices to generate DNA clone grids
- Random pooling designs under various structures
- A universal bound for a covering in regular posets and its application to pool testing
- On parallel attribute-efficient learning.
- Lattice hypercube designs
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- On detecting some defective items in group testing
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
- The expected numbers of unresolved positive clones for various random pool designs
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Exact learning from an honest teacher that answers membership queries
- Bounds for the number of tests in non-adaptive randomized algorithms for group testing
- A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS
- On the upper bounds of the minimum number of rows of disjunct matrices
- Pooling designs for clone library screening in the inhibitor complex model
- Pooling designs associated with unitary space and ratio efficiency comparison
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- The identification of positive clones in a general inhibitor model
- Pattern matching with don't cares and few errors
- Decoding in pooling designs
- An adaptive algorithm for group testing for complexes
- Bounds and algorithms for generalized superimposed codes
- Efficient algorithms for chemical threshold testing problems
- Group testing with random pools: Phase transitions and optimal strategy
- Non-adaptive group testing in the presence of errors
- Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
- Sets pooling designs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5687002)
