An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071): Difference between revisions

Latest revision as of 20:21, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

Journal of Combinatorial Optimization

0 references

publication date

18 February 2008

0 references

zbMATH Keywords

group testing

0 references

pooling designs

0 references

superimposed codes

0 references

graph testing

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s10878-007-9067-3

0 references

cites work

Learning a Hidden Matching

0 references

Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others

0 references

Interval Packing and Covering in the Boolean Lattice

0 references

Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs

0 references

Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping

0 references

Optimal reconstruction of graphs under the additive model

0 references

Nonrandom binary superimposed codes

0 references

On optimal superimposed codes

0 references

A group testing method for finding patterns in data

0 references

Trivial two-stage group testing for complexes using almost disjunct matrices.

0 references

Key storage in secure networks

0 references

Separating systems

0 references

Generalized cover-free families.

0 references

Some new bounds for cover-free families

0 references

Sets pooling designs

0 references

Identifiers

zbMATH Open document ID

1131.05055

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10878-007-9067-3

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2471071

@@ Property / DOI @@
-.1007/s10878-007-9067-3
@@ Property / DOI: 10.1007/s10878-007-9067-3 / rank @@
-Normal rank
@@ Property / author @@
-Hong-Bin Chen
@@ Property / author: Hong-Bin Chen / rank @@
-Normal rank
@@ Property / author @@
-Frank K. Hwang
@@ Property / author: Frank K. Hwang / rank @@
-Normal rank
@@ Property / author @@
+Hong-Bin Chen
@@ Property / author: Hong-Bin Chen / rank @@
+Normal rank
@@ Property / author @@
+Frank K. Hwang
@@ Property / author: Frank K. Hwang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-007-9067-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2016666264
@@ Property / OpenAlex ID: W2016666264 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning a Hidden Matching
@@ Property / cites work: Learning a Hidden Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
+Normal rank
@@ Property / cites work @@
+Interval Packing and Covering in the Boolean Lattice
+Normal rank
@@ Property / cites work @@
+Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
+Normal rank
@@ Property / cites work @@
+Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
+Normal rank
@@ Property / cites work @@
+Optimal reconstruction of graphs under the additive model
+Normal rank
@@ Property / cites work @@
+Nonrandom binary superimposed codes
@@ Property / cites work: Nonrandom binary superimposed codes / rank @@
+Normal rank
@@ Property / cites work @@
+On optimal superimposed codes
@@ Property / cites work: On optimal superimposed codes / rank @@
+Normal rank
@@ Property / cites work @@
+A group testing method for finding patterns in data
+Normal rank
@@ Property / cites work @@
+Trivial two-stage group testing for complexes using almost disjunct matrices.
+Normal rank
@@ Property / cites work @@
+Key storage in secure networks
@@ Property / cites work: Key storage in secure networks / rank @@
+Normal rank
@@ Property / cites work @@
+Separating systems
@@ Property / cites work: Separating systems / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized cover-free families.
@@ Property / cites work: Generalized cover-free families. / rank @@
+Normal rank
@@ Property / cites work @@
+Some new bounds for cover-free families
@@ Property / cites work: Some new bounds for cover-free families / rank @@
+Normal rank
@@ Property / cites work @@
+Sets pooling designs
@@ Property / cites work: Sets pooling designs / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-007-9067-3
@@ Property / DOI: 10.1007/S10878-007-9067-3 / rank @@
+Normal rank