{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:30Z","timestamp":1759637850930},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9067-3","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T21:33:16Z","timestamp":1175290396000},"page":"121-129","source":"Crossref","is-referenced-by-count":15,"title":["An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution"],"prefix":"10.1007","volume":"14","author":[{"given":"H. B.","family":"Chen","sequence":"first","affiliation":[]},{"given":"D. Z.","family":"Du","sequence":"additional","affiliation":[]},{"given":"F. K.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"key":"9067_CR1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/S0097539702420139","volume":"33","author":"N Alon","year":"2004","unstructured":"Alon N, Beigel R, Kasif S, Rudich S, Sudakov B (2004) Learning a hidden matching. SIAM J Comput 33:487\u2013501","journal-title":"SIAM J Comput"},{"key":"9067_CR2","first-page":"133","volume-title":"A comparatively survey of nonadaptive pooling designs, genetic mapping and DNA sequencing, IMA volumes in mathematics and its applications","author":"DZ Balding","year":"1996","unstructured":"Balding DZ, Bruno WJ, Knill E, Torney DC (1996) A comparatively survey of nonadaptive pooling designs, genetic mapping and DNA sequencing, IMA volumes in mathematics and its applications. Springer, New York, pp 133\u2013154"},{"key":"9067_CR3","doi-asserted-by":"crossref","unstructured":"Beigel R, Alon N, Apaydin MS, Fortnow L, Kasif S (2001) An optimal procedure for gap closing in whole genome shotgun sequencing. In: Proc. 2001 RECOMB. ACM Press, pp 22\u201330","DOI":"10.1145\/369133.369152"},{"key":"9067_CR4","volume-title":"Combinatorial group testing and its applications","author":"DZ Du","year":"2000","unstructured":"Du DZ, Hwang FK (2000) Combinatorial group testing and its applications, 2nd edn. World Scientific, Singapore","edition":"2"},{"key":"9067_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1006\/jcta.2002.3257","volume":"99","author":"A D\u2019yachkov","year":"2002","unstructured":"D\u2019yachkov A, Vilenkin PA, Macula AJ, Torney DC (2002) Families of finite sets in which no intersection of \u2113 sets is covered by the union of s others. J Comb Theory Ser A 99:195\u2013218","journal-title":"J Comb Theory Ser A"},{"key":"9067_CR6","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1017\/S0963548300002121","volume":"5","author":"K Engel","year":"1996","unstructured":"Engel K (1996) Interval packing and covering in the boolean lattice. Comb Probab Comput 5:373\u2013384","journal-title":"Comb Probab Comput"},{"key":"9067_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10878-006-9634-z","volume":"12","author":"H Gao","year":"2006","unstructured":"Gao H, Hwang FK, Thai MT, Wu W, Znati T (2006) Construction of d(H)-disjunct matrix for group testing in hypergraphs. J Comb Optim 12:297\u2013301","journal-title":"J Comb Optim"},{"key":"9067_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0166-218X(98)00070-5","volume":"88","author":"V Grebinski","year":"1998","unstructured":"Grebinski V, Kucherov G (1998) Reconstructing a Hamiltonian cycle by querying the graph: application to DNA physical mapping. Discret Appl Math 88:147\u2013165","journal-title":"Discret Appl Math"},{"key":"9067_CR9","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/s004530010033","volume":"28","author":"V Grebinski","year":"2000","unstructured":"Grebinski V, Kucherov G (2000) Optimal reconstruction of graphs under the additive model. Algorithmica 28:104\u2013124","journal-title":"Algorithmica"},{"key":"9067_CR10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","unstructured":"Kautz WH, Singleton RR (1964) Nonrandom binary superimposed codes. IEEE Trans Inform Theory 10:363\u2013377","journal-title":"IEEE Trans Inform Theory"},{"key":"9067_CR11","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/jcd.10056","volume":"12","author":"HK Kim","year":"2004","unstructured":"Kim HK, Lebedev V (2004) On optimal superimposed codes. J Comb Des 12:79\u201391","journal-title":"J Comb Des"},{"key":"9067_CR12","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1504\/IJBRA.2005.008445","volume":"1","author":"Y Li","year":"2005","unstructured":"Li Y, Thai MT, Liu Z, Wu W (2005) Protein\u2013protein interaction and group testing in bipartite graphs. Int J Bioinf Res Appl 1:420\u2013428","journal-title":"Int J Bioinf Res Appl"},{"key":"9067_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.dam.2003.07.009","volume":"144","author":"AJ Macula","year":"2004","unstructured":"Macula AJ, Popyack LJ (2004) A group testing method for finding patterns in data. Discret Appl Math 144:149\u2013157","journal-title":"Discret Appl Math"},{"key":"9067_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1090\/dimacs\/055\/10","volume":"55","author":"AJ Macula","year":"1999","unstructured":"Macula AJ, Torney DC, Vilenkin PA (1999) Two-stage group testing for complexes in the presence of errors. DIMACS Ser Discret Math Theor Comput Sci 55:145\u2013157","journal-title":"DIMACS Ser Discret Math Theor Comput Sci"},{"key":"9067_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0166-218X(03)00191-4","volume":"137","author":"AJ Macula","year":"2004","unstructured":"Macula AJ, Rykov VV, Yekhanin S (2004) Trivial two-stage group testing for complexes using almost disjunct matrices. Discret Appl Math 137:97\u2013107","journal-title":"Discret Appl Math"},{"key":"9067_CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(88)90068-6","volume":"21","author":"CJ Mitchell","year":"1988","unstructured":"Mitchell CJ, Piper FC (1988) Key storage in secure networks. Discret Appl Math 21:215\u2013228","journal-title":"Discret Appl Math"},{"key":"9067_CR17","first-page":"14","volume":"30","author":"YuL Sagalovich","year":"1994","unstructured":"Sagalovich YuL (1994) On separating systems. Probl Peredachi Inform 30:14\u201335 (in Russian)","journal-title":"Probl Peredachi Inform"},{"key":"9067_CR18","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0012-365X(03)00287-5","volume":"279","author":"DR Stinson","year":"2004","unstructured":"Stinson DR, Wei R (2004) Generalized cover-free families. Discret Math 279:463\u2013477","journal-title":"Discret Math"},{"key":"9067_CR19","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"DR Stinson","year":"2000","unstructured":"Stinson DR, Wei R, Zhu L (2000) Some new bounds for cover-free families. J Comb Theory Ser A 90:224\u2013234","journal-title":"J Comb Theory Ser A"},{"key":"9067_CR20","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01609879","volume":"3","author":"DC Torney","year":"1999","unstructured":"Torney DC (1999) Sets pooling designs. Ann Comb 3:95\u2013101","journal-title":"Ann Comb"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9067-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9067-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9067-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:11Z","timestamp":1559276291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9067-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":20,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9067"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9067-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}