{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:11:16Z","timestamp":1773274276221,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,11,28]],"date-time":"2007-11-28T00:00:00Z","timestamp":1196208000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Letters"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s11590-007-0070-5","type":"journal-article","created":{"date-parts":[[2007,11,27]],"date-time":"2007-11-27T09:02:01Z","timestamp":1196154121000},"page":"425-431","source":"Crossref","is-referenced-by-count":24,"title":["An upper bound of the number of tests in pooling designs for the error-tolerant complex model"],"prefix":"10.1007","volume":"2","author":[{"given":"Hong-Bin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Hung-Lin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Frank K.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,28]]},"reference":[{"key":"70_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. and Sudakov B. (2004). Learning a hidden matching. SIAM J. Comput. 33: 487\u2013501","journal-title":"SIAM J. Comput."},{"key":"70_CR2","doi-asserted-by":"crossref","unstructured":"Beigel, R., Alon, N., Apaydin, M.S., Fortnow, L., Kasif, S.: An optimal procedure for gap closing in whole genome shotgun sequencing. In: Proceedings of 2001 RECOMB, pp. 22\u201330. ACM, New York (2001)","DOI":"10.1145\/369133.369152"},{"key":"70_CR3","doi-asserted-by":"crossref","unstructured":"Balding, D.J., Bruno, W.J., Knill, E., Torney, D.C.: A comparative survey of nonadaptive pooling designs. In: Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and Its Applications, pp. 133\u2013154. Springer, Berlin (1996)","DOI":"10.1007\/978-1-4612-0751-1_8"},{"key":"70_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10878-007-9067-3","volume":"14","author":"H.B. Chen","year":"2007","unstructured":"Chen H.B., Du D.Z. and Hwang F.K. (2007). An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. J. Combin. Optim. 14: 121\u2013129","journal-title":"J. Combin. Optim."},{"key":"70_CR5","volume-title":"Combinatorial Group Testing and Its Applications","author":"D.Z. Du","year":"2000","unstructured":"Du D.Z. and Hwang F.K. (2000). Combinatorial Group Testing and Its Applications, 2nd edn. World Scientific, Singapore","edition":"2"},{"key":"70_CR6","volume-title":"Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Sequencing","author":"D.Z. Du","year":"2006","unstructured":"Du D.Z. and Hwang F.K. (2006). Pooling Designs and Nonadaptive Group Testing: Important Tools for DNA Sequencing. World Scientific, Singapore"},{"key":"70_CR7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1006\/jcta.2002.3257","volume":"99","author":"A.G. D\u2019yachkov","year":"2002","unstructured":"D\u2019yachkov A.G., Vilenkin P.A., Macula A.J. and Torney D.C. (2002). Families of finite sets in which no intersection of \u2113 sets is covered by the union of s others. J. Combin. Theory Ser. A 99: 195\u2013218","journal-title":"J. Combin. Theory Ser. A"},{"key":"70_CR8","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. Combin. Prob. Comput. 5: 373\u2013384","journal-title":"Combin. Prob. Comput."},{"key":"70_CR9","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. and Kucherov G. (1998). Reconstructing a Hamiltonian cycle by querying the graph: application to DNA physical mapping. Discrete Appl. Math. 88: 147\u2013165","journal-title":"Discrete Appl. Math."},{"key":"70_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/jcd.10056","volume":"12","author":"H.K. Kim","year":"2004","unstructured":"Kim H.K. and Lebedev V. (2004). On optimal superimposed codes. J. Combin. Designs 12: 79\u201391","journal-title":"J. Combin. Designs"},{"key":"70_CR11","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz L. (1975). On the ratio of optimal integral and fractional covers. Discrete Math. 13: 383\u2013390","journal-title":"Discrete Math."},{"key":"70_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.dam.2003.07.009","volume":"144","author":"A.J. Macula","year":"2004","unstructured":"Macula A.J. and Popyack L.J. (2004). A group testing method for finding patterns in data. Discrete Appl. Math. 144: 149\u2013157","journal-title":"Discrete Appl. Math."},{"key":"70_CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0166-218X(03)00191-4","volume":"137","author":"A.J. Macula","year":"2004","unstructured":"Macula A.J., Rykov V.V. and Yekhanin S. (2004). Trivial two-stage group testing for complexes using almost disjunct matrices. Discrete Appl. Math. 137: 97\u2013107","journal-title":"Discrete Appl. Math."},{"key":"70_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1090\/dimacs\/055\/10","volume":"55","author":"A.J. Macula","year":"1999","unstructured":"Macula A.J., Torney D.C. and Vilenkin P.A. (1999). Two-stage group testing for complexes in the presence of errors. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 55: 145\u2013157","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"key":"70_CR15","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0012-365X(03)00287-5","volume":"279","author":"D.R. Stinson","year":"2004","unstructured":"Stinson D.R. and Wei R. (2004). Generalized cover-free families. Discrete Math. 279: 463\u2013477","journal-title":"Discrete Math."},{"key":"70_CR16","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"D.R. Stinson","year":"2000","unstructured":"Stinson D.R., Wei R. and Zhu L. (2000). Some new bounds for cover-free families. J. Combin. Theory Ser. A 90: 224\u2013234","journal-title":"J. Combin. Theory Ser. A"},{"key":"70_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01609879","volume":"3","author":"D.C. Torney","year":"1999","unstructured":"Torney D.C. (1999). Sets pooling designs. Ann. Combin. 3: 95\u2013101","journal-title":"Ann. Combin."},{"key":"70_CR18","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jcta.2000.3068","volume":"93","author":"H. Wang","year":"2001","unstructured":"Wang H. and Xing C. (2001). Explicit constructions of perfect hash families from algebraic curves over finite fields. J. Combin. Theory Ser. A 93: 112\u2013124","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-007-0070-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-007-0070-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-007-0070-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T11:15:02Z","timestamp":1559560502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-007-0070-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,28]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["70"],"URL":"https:\/\/doi.org\/10.1007\/s11590-007-0070-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,28]]}}}