Publication:5395177
From MaRDI portal
zbMath1284.62009MaRDI QIDQ5395177
Publication date: 1 November 2006
Full work available at URL: http://ebooks.worldscinet.com/ISBN/9789812773463/toc.shtml
62K99: Design of statistical experiments
62-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics
05B30: Other designs, configurations
62K10: Statistical block designs
92D20: Protein sequences, DNA sequences
Related Items
Unnamed Item, Threshold and Majority Group Testing, New Construction of Error-Tolerant Pooling Designs, Group Testing with Multiple Mutually-Obscuring Positives, Unnamed Item, Group testing: Revisiting the ideas, Decoding from Pooled Data: Sharp Information-Theoretic Bounds, Smart elements in combinatorial group testing problems with more defectives, Almost Optimal Cover-Free Families, Optimal deterministic group testing algorithms to estimate the number of defectives, Optimal channel utilization with limited feedback, Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness, A Note on the Minimax Solution for the Two-Stage Group Testing Problem, Optimal group testing, On a couple of unresolved group testing conjectures, Bounds and algorithms for generalized superimposed codes, Adaptive group testing with a constrained number of positive responses improved, Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing, Finding one of \(D\) defective elements in some group testing models, 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, Non-adaptive complex group testing with multiple positive sets, Pooling semilattices and non-adaptive pooling designs, A generalization of Macula's disjunct matrices, On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges, Learning a hidden graph, A new strongly competitive group testing algorithm with small sequentiality, Interval group testing for consecutive positives, A construction of pooling designs with surprisingly high degree of error correction, New error-correcting pooling designs associated with finite vector spaces, Constructing error-correcting pooling designs with symplectic space, Approaching pooling design with smaller efficient ratio, DNA library screening, pooling design and unitary spaces, A generalization of the formulas for intersection numbers of dual polar association schemes and their applications, Pooling designs with surprisingly high degree of error correction in a finite vector space, Reconstruction of hidden graphs and threshold group testing, Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing, Improvements on some error-tolerance pooling designs, Pooling spaces associated with finite geometry, 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, Error-correcting pooling designs associated with some distance-regular graphs, Nonadaptive group testing with lies: probabilistic existence theorems, Pooling designs associated with unitary space and ratio efficiency comparison, Non-unique probe selection and group testing, More on pooling spaces, 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, Searching for an edge in a graph with restricted test sets, On the upper bounds of the minimum number of rows of disjunct matrices, Nonadaptive algorithms for threshold group testing, Edge search in graphs with restricted test sets, A construction of \(d^z\)-disjunct matrices by orthogonal space and discussion on their design parameters, On optimal policy in the group testing with incomplete identification, Exact learning of juntas from membership queries, Non-adaptive learning of a hidden hypergraph, Adaptive search for one defective in the additive group testing model, Smart elements in combinatorial group testing problems, Anzahl formulas of subspaces in symplectic spaces and their applications, An NP-completeness result of edge search in graphs, A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework, Random and quasi-random designs in group testing, Group testing problem with two defectives, Sterrett procedure for the generalized group testing problem, Low-weight superimposed codes and related combinatorial structures: bounds and applications, Improving the existence bounds for grid-block difference families, New error-correcting pooling designs with vector spaces over finite field, Erasure combinatorial batch codes based on nonadaptive group testing, Grid-block difference families and related combinatorial structures, Non-adaptive group testing on graphs with connectivity, Error-tolerance pooling designs based on Johnson graphs, Threshold group testing with consecutive positives, Strict group testing and the set basis problem, On the complexity of non-unique probe selection, Exact learning from an honest teacher that answers membership queries, Strongly separable matrices for nonadaptive combinatorial group testing, Upper and lower bounds for competitive group testing, Non-adaptive Learning of a Hidden Hypergraph, Randomized Group Testing Both Query-Optimal and Minimal Adaptive, Non-adaptive Complex Group Testing with Multiple Positive Sets, Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing
