Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices

DOI10.1016/j.dam.2006.10.009zbMath1119.15027OpenAlexW1982865907MaRDI QIDQ875600

Hong-Bin Chen, Frank K. Hwang

Publication date: 13 April 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.10.009

zbMATH Keywords

separablegroup testingpooling designsDNA sequencingcoding, extremal set theorydisjunct

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Other types of codes (94B60) Genetics and epigenetics (92D10) Separability of topological spaces (54D65)

Related Items (8)

Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES ⋮ Strongly separable matrices for nonadaptive combinatorial group testing ⋮ Identifying defective sets using queries of small size ⋮ Strict group testing and the set basis problem ⋮ Almost separable matrices ⋮ COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY ⋮ Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Union-free hypergraphs and probability theory
• New combinatorial designs and their applications to group testing
• Families of finite sets in which no set is covered by the union of \(r\) others
• Hypergeometric and Generalized Hypergeometric Group Testing
• Nonrandom binary superimposed codes

This page was built for publication: Exploring the missing link among \(d\)-separable, \(\overline d\)-separable and \(d\)-disjunct matrices