{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:29:40Z","timestamp":1752229780109,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648246"},{"type":"electronic","value":"9783540685357"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68535-9_16","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:31:22Z","timestamp":1193473882000},"page":"127-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Algorithms for Chemical Threshold Testing Problems"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"De Bonis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"E. Barillot et al., \u201cTheoretical analysis of library screening using a n-dimensional pooling strategy\u201d, Nucleic Acids Research, (1991), 6241\u20136247.","key":"16_CR1","DOI":"10.1093\/nar\/19.22.6241"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","volume":"5","author":"J.L. Bentley","year":"1976","unstructured":"J.L. Bentley and A. Yao, \u201cAn almost optimal algorithm for unbounded search\u201d, IPL 5, (1976), 82\u201387.","journal-title":"IPL"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0888-7543(95)80078-Z","volume":"26","author":"W. J. Bruno","year":"1995","unstructured":"W. J. Bruno et al., \u201cDesign of efficient pooling experiments\u201d, Genomics, vol., 26, (1995), 21\u201330.","journal-title":"Genomics"},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","first-page":"215","volume-title":"CIAC\u2019 97","author":"P. Damaschke","year":"1997","unstructured":"P. Damaschke, \u201cThe algorithmic complexity of chemical threshold testing\u201d, in: CIAC\u2019 97, LNCS, 1203, Springer-Verlag, (1997), 215\u2013216."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R. Dorfman","year":"1943","unstructured":"R. Dorfman, \u201cThe detection of defective members of large populations\u201d, Ann. Math. Stat., 14 (1943), 436\u2013440.","journal-title":"Ann. Math. Stat."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0166-218X(93)90011-C","volume":"45","author":"D.Z. Du","year":"1993","unstructured":"D.Z. Du and F.K. Hwang, \u201cCompetitive group testing\u201d, Discrete Applied Math., 45 (1993), 221\u2013232.","journal-title":"Discrete Applied Math."},{"unstructured":"D.Z. Du and F.K. Hwang, Combinatorial Group Testing and its Applications, World Scientific Publishing, (1993).","key":"16_CR7"},{"doi-asserted-by":"crossref","unstructured":"M. Farach et al., \u201cGroup testing problems with sequences in experimental molecular biology\u201d, in: Proc. Compr. and Compl. of Sequences\u2019 97, B. Carpentieri, A. De Santis, J. Storer, and U. Vaccaro, (Eds.), IEEE Computer Society, pp. 357\u2013367.","key":"16_CR8","DOI":"10.1109\/SEQUEN.1997.666930"},{"issue":"6","key":"16_CR9","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/12.600831","volume":"46","author":"F.K. Hwang","year":"1997","unstructured":"F.K. Hwang and P.J. Wan, \u201cComparing file copies with at most three disagreeing pages\u201d IEEE Transactions on Computers, 46, No. 6, (June 1997), 716\u2013718.","journal-title":"IEEE Transactions on Computers"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1002\/j.1538-7305.1959.tb03914.x","volume":"38","author":"M. Sobel","year":"1959","unstructured":"M. Sobel and P.A. Groll, \u201cGroup testing to eliminate efficiently all defectives in a binomial sample\u201d, Bell System Tech. J. 38, (1959), 1179\u20131252.","journal-title":"Bell System Tech. J."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","volume":"IT-31","author":"J. K. Wolf","year":"1985","unstructured":"J. K. Wolf, \u201cBorn again group testing: Multiacces communications\u201d, IEEE Trans. Inf. Th. IT-31, (1985), 185\u2013191.","journal-title":"IEEE Trans. Inf. Th."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68535-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:26:32Z","timestamp":1737501992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68535-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648246","9783540685357"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-68535-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"4 June 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}