scientific article; zbMATH DE number 956611

MaRDI QIDQ5687002zbMATH OpenFDO

Authors William J. Bruno, Emanuel Knill, David C. Torney, David Joseph Balding

Publication date 16 April 1997

zbMATH Keywords

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

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Protein sequences, DNA sequences (92D20)

Recommendations

• Sets pooling designs
• Non-adaptive group testing in the presence of errors
• Asymptotics of pooling design performance
• Pooling designs for clone library screening in the inhibitor complex model

Cited in

(35)

• Pooling designs for clone library screening in the inhibitor complex model
• On detecting some defective items in group testing
• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• Non-adaptive group testing in the presence of errors
• New constructions of non-adaptive and error-tolerance pooling designs
• Pooling designs associated with unitary space and ratio efficiency comparison
• Exact learning from an honest teacher that answers membership queries
• Identifying defective network components through restricted group testing
• Sets pooling designs
• Asymptotics of pooling design performance
• The expected numbers of unresolved positive clones for various random pool designs
• The identification of positive clones in a general inhibitor model
• Random pooling designs under various structures
• Tracing a single user
• Bounds for the number of tests in non-adaptive randomized algorithms for group testing
• On the upper bounds of the minimum number of rows of disjunct matrices
• A GENERAL APPROACH TO COMPUTE THE PROBABILITIES OF UNRESOLVED CLONES IN RANDOM POOLING DESIGNS
• Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices
• Bounds and algorithms for generalized superimposed codes
• An upper bound of the number of tests in pooling designs for the error-tolerant complex model
• Lattice hypercube designs
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Pattern matching with don't cares and few errors
• Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
• Probabilistic nonadaptive group testing in the presence of errors and DNA library screening
• RANDOM k-SET POOL DESIGNS WITH DISTINCT COLUMNS
• Efficient algorithms for chemical threshold testing problems
• Decoding in pooling designs
• An adaptive algorithm for group testing for complexes
• Group testing with random pools: Phase transitions and optimal strategy
• Pooling, lattice square, and union jack designs
• Using transforming matrices to generate DNA clone grids
• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• A universal bound for a covering in regular posets and its application to pool testing
• On parallel attribute-efficient learning.

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)