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

DOI10.1007/S10878-007-9067-3zbMATH Open1131.05055OpenAlexW2016666264MaRDI QIDQ2471071FDOQ2471071

Authors: Du Ding-Zhu, Hongbin 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

Recommendations

• scientific article; zbMATH DE number 5262869
• Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes
• Superimposed codes and threshold group testing
• Non-adaptive group testing on graphs
• scientific article; zbMATH DE number 25604

zbMATH Keywords

group testingsuperimposed codesgraph testingpooling designs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471071)