{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T06:33:38Z","timestamp":1724135618787},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1109\/tit.2011.2148691","type":"journal-article","created":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T14:06:43Z","timestamp":1304431603000},"page":"7057-7067","source":"Crossref","is-referenced-by-count":41,"title":["Group Testing With Probabilistic Tests: Theory, Design and Application"],"prefix":"10.1109","volume":"57","author":[{"given":"Mahdi","family":"Cheraghchi","sequence":"first","affiliation":[]},{"given":"Ali","family":"Hormati","sequence":"additional","affiliation":[]},{"given":"Amin","family":"Karbasi","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Vetterli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032726"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046199"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034796"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2009.2039170"},{"key":"ref37","article-title":"A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods","author":"iwen","year":"2008","journal-title":"Proc 12th Symp Discrete Algorithms (SODA)"},{"key":"ref36","article-title":"Selective families, superimposed codes, and broadcasting on unknown radio networks","author":"clementi","year":"2001","journal-title":"Proc 12th Symp Discrete Algorithms (SODA)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/63.3.671"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595378"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.0195"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057026"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2002.801124"},{"key":"ref13","first-page":"151","article-title":"$k$<\/tex> <\/formula>-mismatch with don't cares","volume":"4698","author":"clifford","year":"2007","journal-title":"Proceedings of the European Symposium on Algorithms (ESA)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061325"},{"key":"ref15","first-page":"100","article-title":"Pairwise testing","volume":"78","author":"blass","year":"2002","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286461"},{"key":"ref17","doi-asserted-by":"crossref","author":"du","year":"1999","journal-title":"Combinatorial Group Testing and its Applications","DOI":"10.1142\/4252"},{"key":"ref18","doi-asserted-by":"crossref","author":"du","year":"2006","journal-title":"Pooling Designs and Nonadaptive Group Testing","DOI":"10.1142\/6122"},{"key":"ref19","author":"atia","year":"2009","journal-title":"Boolean Compressed Sensing and Noisy Group Testing"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1198\/004017007000000308"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb03914.x"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1090\/dimacs\/055\/13","article-title":"A survey on combinatorial group testing algorithms with applications to DNA library screening","volume":"55","author":"ngo","year":"2000","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074574"},{"key":"ref5","first-page":"143","article-title":"Towards DNA sequencing chips","volume":"841","author":"pevzner","year":"1994","journal-title":"International Symposium on Mathematical Foundations of Computer Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01609876"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2003.1227307"},{"key":"ref2","author":"hadamard","year":"1923","journal-title":"Lectures on the Cauchy Problem in Linear Partial Differential Equations"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009732820981"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394829"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2004.1337550"},{"key":"ref22","first-page":"1","article-title":"A survey of superimposed code theory","volume":"12","author":"dyachkov","year":"1983","journal-title":"Problem of Control and Information Theory"},{"key":"ref21","first-page":"7","article-title":"Bound of the length of disjunct codes","volume":"18","author":"dyachkov","year":"1982","journal-title":"Problems of Information Transmission"},{"key":"ref24","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$<\/tex><\/formula> others","volume":"51","author":"erdos","year":"1985","journal-title":"Israel J Math"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90004-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref25","first-page":"257","article-title":"Non-adaptive hypergeometric group testing","volume":"22","author":"hwang","year":"1985","journal-title":"Studia Scient Math"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6034704\/05759087.pdf?arnumber=5759087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:53:33Z","timestamp":1642006413000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5759087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":38,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2148691","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}
