scientific article; zbMATH DE number 5070274

zbMath1284.62009MaRDI QIDQ5395177

Publication date: 1 November 2006

Full work available at URL: http://ebooks.worldscinet.com/ISBN/9789812773463/toc.shtml

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Design of statistical experiments (62K99) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Other designs, configurations (05B30) Statistical block designs (62K10) Protein sequences, DNA sequences (92D20)

Related Items (89)

Adaptive group testing with a constrained number of positive responses improved ⋮ A Note on the Minimax Solution for the Two-Stage Group Testing Problem ⋮ Optimal group testing ⋮ Improving the existence bounds for grid-block difference families ⋮ Almost Optimal Cover-Free Families ⋮ Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing ⋮ Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ Exact learning from an honest teacher that answers membership queries ⋮ On optimal policy in the group testing with incomplete identification ⋮ Random and quasi-random designs in group testing ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Exact learning of juntas from membership queries ⋮ Strongly separable matrices for nonadaptive combinatorial group testing ⋮ New error-correcting pooling designs with vector spaces over finite field ⋮ Finding one of \(D\) defective elements in some group testing models ⋮ New error-correcting pooling designs associated with finite vector spaces ⋮ Synthetic sequence design for signal location search ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Two new perspectives on multi-stage group testing ⋮ Efficient two-stage group testing algorithms for genetic screening ⋮ Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization ⋮ Constructing error-correcting pooling designs with symplectic space ⋮ Non-adaptive complex group testing with multiple positive sets ⋮ Pooling semilattices and non-adaptive pooling designs ⋮ Erasure combinatorial batch codes based on nonadaptive group testing ⋮ Approaching pooling design with smaller efficient ratio ⋮ Grid-block difference families and related combinatorial structures ⋮ DNA library screening, pooling design and unitary spaces ⋮ On a couple of unresolved group testing conjectures ⋮ A generalization of Macula's disjunct matrices ⋮ On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges ⋮ A generalization of the formulas for intersection numbers of dual polar association schemes and their applications ⋮ Non-adaptive group testing on graphs with connectivity ⋮ Bounds and algorithms for generalized superimposed codes ⋮ Unnamed Item ⋮ Anzahl formulas of subspaces in symplectic spaces and their applications ⋮ Improvements on some error-tolerance pooling designs ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Smart elements in combinatorial group testing problems with more defectives ⋮ Upper and lower bounds for competitive group testing ⋮ Error-tolerance pooling designs based on Johnson graphs ⋮ Threshold group testing with consecutive positives ⋮ Strict group testing and the set basis problem ⋮ Pooling spaces associated with finite geometry ⋮ Learning a hidden graph ⋮ Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing ⋮ A new strongly competitive group testing algorithm with small sequentiality ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ A construction of \(d^z\)-disjunct matrices in a dual space of symplectic space ⋮ Non-adaptive Complex Group Testing with Multiple Positive Sets ⋮ On the complexity of non-unique probe selection ⋮ Adaptive search for one defective in the additive group testing model ⋮ Smart elements in combinatorial group testing problems ⋮ Threshold and Majority Group Testing ⋮ New Construction of Error-Tolerant Pooling Designs ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ Interval group testing for consecutive positives ⋮ Error-correcting pooling designs associated with some distance-regular graphs ⋮ A construction of pooling designs with surprisingly high degree of error correction ⋮ Group testing problem with two defectives ⋮ An NP-completeness result of edge search in graphs ⋮ Pooling designs with surprisingly high degree of error correction in a finite vector space ⋮ Nonadaptive group testing with lies: probabilistic existence theorems ⋮ Pooling designs associated with unitary space and ratio efficiency comparison ⋮ Reconstruction of hidden graphs and threshold group testing ⋮ Unnamed Item ⋮ Non-unique probe selection and group testing ⋮ Sterrett procedure for the generalized group testing problem ⋮ Low-weight superimposed codes and related combinatorial structures: bounds and applications ⋮ More on pooling spaces ⋮ Conjectures on optimal nested generalized group testing algorithm ⋮ Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix ⋮ The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks ⋮ On detecting some defective items in group testing ⋮ Optimal deterministic group testing algorithms to estimate the number of defectives ⋮ Improved lower bound for estimating the number of defective items ⋮ A survey of cover-free families: constructions, applications, and generalizations ⋮ Optimal Dorfman group testing for symmetric distributions ⋮ Optimal channel utilization with limited feedback ⋮ Searching for an edge in a graph with restricted test sets ⋮ On the upper bounds of the minimum number of rows of disjunct matrices ⋮ A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework ⋮ Nonadaptive algorithms for threshold group testing ⋮ Non-adaptive Learning of a Hidden Hypergraph ⋮ Group testing: Revisiting the ideas ⋮ Edge search in graphs with restricted test sets ⋮ A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters ⋮ Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness ⋮ Decoding from Pooled Data: Sharp Information-Theoretic Bounds

This page was built for publication: