乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T04:35:15Z","timestamp":1714624515319},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":5372,"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":[[1998,11]]},"DOI":"10.1016\/s0166-218x(98)00075-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"261-290","source":"Crossref","is-referenced-by-count":22,"title":["Non-adaptive group testing in the presence of errors"],"prefix":"10.1016","volume":"88","author":[{"given":"E.","family":"Knill","sequence":"first","affiliation":[]},{"given":"W.J.","family":"Bruno","sequence":"additional","affiliation":[]},{"given":"D.C.","family":"Torney","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00075-4_BIB1","first-page":"133","article-title":"A comparative survey of non-adaptive pooling designs","volume":"vol. 81","author":"Balding","year":"1995"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/jcta.1996.0041","article-title":"Optimal pooling with error detection","volume":"74","author":"Balding","year":"1996","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0166-218X(98)00075-4_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","author":"Barillot","year":"1991","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/S0166-218X(98)00075-4_BIB4","series-title":"Design Theory","author":"Beth","year":"1986"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB5","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0888-7543(95)80078-Z","article-title":"Design of efficient pooling experiments","volume":"26","author":"Bruno","year":"1995","journal-title":"Genomics"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB6","article-title":"Group testing designs for partially characterized objects","author":"Bruno","year":"1996"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB7","series-title":"Their Applications to Science and Industry","article-title":"Punched Cards","year":"1958"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB8","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1214\/aoms\/1177731363","article-title":"The detection of defective members of large populations","volume":"14","author":"Dorfman","year":"1943","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0166-218X(98)00075-4_BIB9","first-page":"1","article-title":"A survey of superimposed code theory","volume":"12","author":"Dyachkov","year":"1983","journal-title":"Problems Control Inform. Theory"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB10","first-page":"237","article-title":"Superimposed distance codes","volume":"18","author":"Dyachkov","year":"1989","journal-title":"Problems Control Inform. Theory"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB11","first-page":"68","volume":"11","author":"Gerardin","year":"1916","journal-title":"Sphinx-Oedipe"},{"key":"10.1016\/S0166-218X(98)00075-4_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. Inform. Theory"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB13","series-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"369","article-title":"Lower bounds for identifying subset members with subset queries","author":"Knill","year":"1995"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB14","article-title":"Group testing problems in experimental computational biology","author":"Knill","year":"1994"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1089\/cmb.1996.3.395","article-title":"Baysean decoding of pooling results using the monte carlo method","author":"Knill","year":"1996","journal-title":"J. Comput. Biol. 3(LAUR-95-2402)"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB16","series-title":"Math\u00e9matique des Jeux ou Recreations Math\u00e9matique (Mathematical Recreations)","author":"Kraitchik","year":"1930"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB17","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1109\/26.8945","article-title":"Multiple-access algorithms via group testing for heterogenous populations of users","volume":"36","author":"Kurtz","year":"1988","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0166-218X(98)00075-4_BIB18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0888-7543(88)90007-9","article-title":"Genomic mapping by fingerprinting random clones","volume":"2","author":"Lander","year":"1988","journal-title":"Genomics"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB19","series-title":"Proceedings of the International Symposium on the Theory of Switching","first-page":"144","article-title":"Simultaneous-access matrix storage systems","author":"Minnick","year":"1957"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB20","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1108\/eb026235","article-title":"Some probability problems concerning the marking of codes into the superimposition field","volume":"12","author":"Orosz","year":"1596","journal-title":"J. Documentation"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u00f6s","year":"1985","journal-title":"Israel J. Math."},{"key":"10.1016\/S0166-218X(98)00075-4_BIB22","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/S0166-218X(98)00075-4_BIB23","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1002\/j.1538-7305.1959.tb03914.x","article-title":"Group testing to eliminate efficiently all defectives in a binomial sample","volume":"28","author":"Sobel","year":"1959","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0166-218X(98)00075-4_BIB24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","article-title":"Born again group testing: Multiaccess communications","author":"Wolf","year":"1985","journal-title":"IEEE Trans. Inform. Theory IT-31"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000754?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000754?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:52:15Z","timestamp":1556117535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0166218X98000754"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00075-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}