An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution

DOI10.1007/s10878-007-9067-3zbMath1131.05055OpenAlexW2016666264MaRDI QIDQ2471071

Ding-Zhu Du, Hong-Bin Chen, Frank K. Hwang

Publication date: 18 February 2008

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9067-3

zbMATH Keywords

group testingpooling designssuperimposed codesgraph testing

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Cryptography (94A60) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Genetics and epigenetics (92D10)

Related Items (7)

Improved constructions for non-adaptive threshold group testing ⋮ Improved even order magic square construction algorithms and their applications in multi-user shared electronic accounts ⋮ A survey on nonadaptive group testing algorithms through the angle of decoding ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ An adaptive algorithm for group testing for complexes ⋮ Group Testing with Multiple Mutually-Obscuring Positives ⋮ Nonadaptive algorithms for threshold group testing

Cites Work

• Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
• Key storage in secure networks
• Separating systems
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Sets pooling designs
• Trivial two-stage group testing for complexes using almost disjunct matrices.
• Generalized cover-free families.
• A group testing method for finding patterns in data
• Some new bounds for cover-free families
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
• Interval Packing and Covering in the Boolean Lattice
• On optimal superimposed codes
• Learning a Hidden Matching
• Nonrandom binary superimposed codes
• Optimal reconstruction of graphs under the additive model

This page was built for publication: An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution