{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T04:30:12Z","timestamp":1745123412201},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","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,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0012-365x(02)00815-4","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"293-309","source":"Crossref","is-referenced-by-count":5,"title":["A universal bound for a covering in regular posets and its application to pool testing"],"prefix":"10.1016","volume":"266","author":[{"given":"Vladimir I.","family":"Levenshtein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(02)00815-4_BIB1","series-title":"Algebraic Combinatorics. I. Association Schemes","author":"Bannai","year":"1984"},{"issue":"7","key":"10.1016\/S0012-365X(02)00815-4_BIB2","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. Inform. Theory"},{"key":"10.1016\/S0012-365X(02)00815-4_BIB3","series-title":"Distance-Regular Graphs","author":"Brouwer","year":"1989"},{"key":"10.1016\/S0012-365X(02)00815-4_BIB4","unstructured":"P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. (Suppl.) 10 (1973)."},{"key":"10.1016\/S0012-365X(02)00815-4_BIB5","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0097-3165(76)90017-0","article-title":"Association schemes and t-design in regular semilattices","volume":"20","author":"Delsarte","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(02)00815-4_BIB6","unstructured":"J.H. Dinitz, D.R. Stinson (Eds.), Contemporary Design Theory, Wiley Interscience Publication, New York, 1992."},{"key":"10.1016\/S0012-365X(02)00815-4_BIB7","series-title":"Combinatorial Group Testing and its Applications","author":"Du","year":"1993"},{"issue":"4","key":"10.1016\/S0012-365X(02)00815-4_BIB8","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Nonrandom binary superposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(02)00815-4_BIB9","unstructured":"E. Knill, Lower bounds for identifying subset members with subset queries. Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 22\u201324, 1995, 369\u2013377 (Chapter 40)."},{"key":"10.1016\/S0012-365X(02)00815-4_BIB10","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/jcd.3180030606","article-title":"Proper S(t,K,v)'s for t\u2a7e 3, v\u2a7d 16,|K|>1 and their extensions","volume":"3","author":"Kramer","year":"1995","journal-title":"J. Combin. Designs"},{"key":"10.1016\/S0012-365X(02)00815-4_BIB11","unstructured":"V.I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Dokl. Akad. Nauk. 163(4) (1965) 845\u2013848 (in Russian). English translation in Sov. Phys. - Dokl. 10 (8) (1966) 707\u2013710."},{"key":"10.1016\/S0012-365X(02)00815-4_BIB12","unstructured":"V.I. Levenshtein, Elements of coding theory, in: Discrete Mathematics and Math. Problems of Cybernetics, Nauka, Moscow, 1974, pp. 207\u2013305 (in Russian). Diskrete Mathematik und Mathematische Fragen der Kybernetik, Academie-Verlag, Berlin, 1980, pp. 198\u2013279 (German translation)."},{"issue":"2","key":"10.1016\/S0012-365X(02)00815-4_BIB13","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1006\/jcta.2000.3081","article-title":"Efficient reconstruction of sequences from their subsequences or supersequences","volume":"93","author":"Levenshtein","year":"2001","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(02)00815-4_BIB14","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0012-365X(02)00815-4_BIB15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/(SICI)1520-6610(1996)4:3<203::AID-JCD3>3.0.CO;2-J","article-title":"A class of Steiner 4-wise balanced designs derived from Preparata codes","volume":"4","author":"Tonchev","year":"1996","journal-title":"J. Combin. Designs"},{"key":"10.1016\/S0012-365X(02)00815-4_BIB16","unstructured":"V.A. Zinoviev, Combinatorial methods of construction and analysis of nonlinear error-correcting codes, Doctor of Sciences Diss., Moscow, 1985 (in Russian)."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T16:22:55Z","timestamp":1553790175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X02008154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0012365X02008154"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00815-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}