{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:45:59Z","timestamp":1774313159514,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00433-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"11-26","source":"Crossref","is-referenced-by-count":10,"title":["Application of cover-free codes and combinatorial designs to two-stage testing"],"prefix":"10.1016","volume":"128","author":[{"given":"Toby","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir I.","family":"Levenshtein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00433-X_BIB1","doi-asserted-by":"crossref","first-page":"2373","DOI":"10.1109\/18.887851","article-title":"Upper bounds for constant-weight codes","volume":"46","author":"Agrell","year":"2000","journal-title":"IEEE Trans. IT"},{"key":"10.1016\/S0166-218X(02)00433-X_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/jcta.1996.0041","article-title":"Optimal pooling designs with error detection","volume":"74","author":"Balding","year":"1996","journal-title":"J. Combin. Theory, A"},{"key":"10.1016\/S0166-218X(02)00433-X_BIB3","doi-asserted-by":"crossref","first-page":"6241","DOI":"10.1093\/nar\/19.22.6241","article-title":"Theoretical analysis of library screening using an N-dimensional pooling strategy","volume":"19","author":"Barillot","year":"1991","journal-title":"Nucleic Acids Res"},{"issue":"7","key":"10.1016\/S0166-218X(02)00433-X_BIB4","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1109\/TIT.2002.1013122","article-title":"Asymptotic efficiency of two-stage disjunctive testing","volume":"48","author":"Berger","year":"2002","journal-title":"IEEE Trans. IT"},{"key":"10.1016\/S0166-218X(02)00433-X_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1111\/j.0006-341X.2000.00833.x","article-title":"Maximally efficient two-stage group testing","volume":"56","author":"Berger","year":"2000","journal-title":"Biometrics"},{"key":"10.1016\/S0166-218X(02)00433-X_BIB6","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"Delsarte","year":"1973","journal-title":"Philips Res. Rep. Suppl"},{"key":"10.1016\/S0166-218X(02)00433-X_BIB7","unstructured":"J.H. Dinitz, D.R. Stinson (Eds.), Contemporary Design Theory, Wiley-Interscience, New York, 1992."},{"key":"10.1016\/S0166-218X(02)00433-X_BIB8","first-page":"11","article-title":"A survey of superimposed distance codes","volume":"12","author":"Djachkov","year":"1983","journal-title":"Problems Control Informat. Theory"},{"key":"10.1016\/S0166-218X(02)00433-X_BIB9","unstructured":"A.G. Djachkov, V.V. Rykov, On constant-weight disjunctive codes, in: Proceedings of IX Symposium on Redundancy Problem in Information Systems, Part I, Leningrad, 1986, pp. 116\u2013119 (in Russian)."},{"key":"10.1016\/S0166-218X(02)00433-X_BIB10","series-title":"Combinatorial Group Testing and its Applications","author":"Du","year":"1993"},{"key":"10.1016\/S0166-218X(02)00433-X_BIB11","first-page":"257","article-title":"Non-adaptive hypergeometric group testing","volume":"22","author":"Hwang","year":"1987","journal-title":"Stud. Sci. Math. Hung"},{"issue":"4","key":"10.1016\/S0166-218X(02)00433-X_BIB12","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Nonrandom binary superimposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Trans. IT"},{"key":"10.1016\/S0166-218X(02)00433-X_BIB13","unstructured":"E. Knill, Lower bounds for identifying subset members with subset queries. in: Proceedings of the Sixth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 22\u201324, 1995, 369\u2013377, (Chapter 40)."},{"key":"10.1016\/S0166-218X(02)00433-X_BIB14","first-page":"223","article-title":"Bounds on constant weight binary superimposed codes","volume":"17","author":"Nguyen","year":"1988","journal-title":"Probl. Control Inform. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0200433X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0200433X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T14:30:02Z","timestamp":1553178602000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0200433X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X0200433X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00433-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}