{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T04:09:58Z","timestamp":1780459798658,"version":"3.54.1"},"reference-count":204,"publisher":"Emerald","issue":"3-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12,5]]},"abstract":"<jats:p>The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no defectives. This is a sparse inference problem with a combinatorial flavour, with applications in medical testing, biology, telecommunications, information technology, data science, and more.<\/jats:p>\n                  <jats:p>In this monograph, we survey recent developments in the group testing problem from an information-theoretic perspective. We cover several related developments: efficient algorithms with practical storage and computation requirements, achievability bounds for optimal decoding methods, and algorithm-independent converse bounds. We assess the theoretical guarantees not only in terms of scaling laws, but also in terms of the constant factors, leading to the notion of the rate of group testing, indicating the amount of information learned per test. Considering both noiseless and noisy settings, we identify several regimes where existing algorithms are provably optimal or near-optimal, as well as regimes where there remains greater potential for improvement.<\/jats:p>\n                  <jats:p>In addition, we survey results concerning a number of variations on the standard group testing problem, including partial recovery criteria, adaptive algorithms with a limited number of stages, constrained test designs, and sublinear-time algorithms.<\/jats:p>","DOI":"10.1561\/0100000099","type":"journal-article","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T06:38:20Z","timestamp":1575527900000},"page":"196-392","source":"Crossref","is-referenced-by-count":171,"title":["Group Testing: An Information Theory Perspective"],"prefix":"10.1108","volume":"15","author":[{"given":"Matthew","family":"Aldridge","sequence":"first","affiliation":[{"name":"University of Leeds ,","place":["UK"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oliver","family":"Johnson","sequence":"additional","affiliation":[{"name":"University of Bristol ,","place":["UK"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jonathan","family":"Scarlett","sequence":"additional","affiliation":[{"name":"National University of Singapore ,","place":["Singapore"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2019,12,5]]},"reference":[{"key":"2026032712273552600_ref001","article-title":"On learning graphs with edge-detecting queries","author":"Abasi","year":"2018"},{"key":"2026032712273552600_ref002","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2018.8437471","article-title":"Novel impossibility results for group-testing","author":"Agarwal","year":"2018"},{"issue":"3","key":"2026032712273552600_ref003","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(86)90026-0","article-title":"Search problems on graphs","volume":"14","author":"Aigner","year":"1986","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"2026032712273552600_ref004","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/jgt.3190120106","article-title":"Searching for an edge in a graph","volume":"12","author":"Aigner","year":"1988","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"2026032712273552600_ref005","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/TIT.2016.2605122","article-title":"Sparse signal processing with linear and nonlinear observations: A unified Shannon-theoretic approach","volume":"63","author":"Aksoylar","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref006","unstructured":"Aldridge, M.\n          . 2011. \u201cInterference mitigation in large random wireless networks\u201d. PhD thesis. University of Bristol. arXiv: 1109.1255."},{"key":"2026032712273552600_ref007","doi-asserted-by":"publisher","first-page":"3085","DOI":"10.1109\/ISIT.2017.8007097","article-title":"On the optimality of some group testing algorithms","author":"Aldridge","year":"2017","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"issue":"11","key":"2026032712273552600_ref008","doi-asserted-by":"publisher","first-page":"7142","DOI":"10.1109\/TIT.2017.2748564","article-title":"The capacity of Bernoulli nonadaptive group testing","volume":"63","author":"Aldridge","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712273552600_ref009","doi-asserted-by":"publisher","first-page":"2058","DOI":"10.1109\/TIT.2018.2873136","article-title":"Individual testing is optimal for nonadaptive group testing in the linear regime","volume":"65","author":"Aldridge","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref010","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2019.8849712","article-title":"Rates for adaptive group testing in the linear regime","author":"Aldridge","year":"2019"},{"issue":"1","key":"2026032712273552600_ref011","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10878-015-9951-1","article-title":"Almost separable matrices","volume":"33","author":"Aldridge","year":"2017","journal-title":"Journal of Combinatorial Optimization"},{"issue":"6","key":"2026032712273552600_ref012","doi-asserted-by":"publisher","first-page":"3671","DOI":"10.1109\/TIT.2014.2314472","article-title":"Group testing algorithms: Bounds and simulations","volume":"60","author":"Aldridge","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref013","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-36899-8_29","article-title":"An efficient algorithm for combinatorial group testing","author":"Allemann","year":"2013","journal-title":"Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede"},{"key":"2026032712273552600_ref014","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1137\/1.9781611974331.ch65","article-title":"Efficient quantum algorithms for (gapped) group testing and junta testing","author":"Ambainis","year":"2016","journal-title":"Proceedings of the 27th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA)"},{"key":"2026032712273552600_ref015","volume-title":"Information Theory","author":"Ash","year":"1990"},{"key":"2026032712273552600_ref016","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/ccnc08.2007.222","article-title":"On throughput maximization and interference avoidance in cognitive radios","volume-title":"5th IEEE Consumer Communications and Networking Conference (CCNC)","author":"Atia","year":"2008"},{"issue":"3","key":"2026032712273552600_ref017","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1109\/TIT.2011.2178156","article-title":"Boolean compressed sensing and noisy group testing","volume":"58","author":"Atia","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712273552600_ref018","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1109\/TIT.2015.2392116","article-title":"Correction to \u2018Boolean compressed sensing and noisy group testing\u2019","volume":"61","author":"Atia","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"2026032712273552600_ref019","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s11128-007-0061-6","article-title":"Quantum algorithms for learning and testing juntas","volume":"6","author":"Atici","year":"2007","journal-title":"Quantum Information Processing"},{"key":"2026032712273552600_ref020","doi-asserted-by":"publisher","first-page":"2676","DOI":"10.1109\/ISIT.2013.6620712","article-title":"The capacity of adaptive group testing","author":"Baldassini","year":"2013","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"2026032712273552600_ref021","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-1-4612-0751-1_8","article-title":"A comparative survey of non-adaptive pooling designs","author":"Balding","year":"1996","journal-title":"Genetic Mapping and DNA Sequencing"},{"issue":"7","key":"2026032712273552600_ref022","doi-asserted-by":"publisher","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 Transactions on Information Theory"},{"issue":"7","key":"2026032712273552600_ref023","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TCOM.1984.1096146","article-title":"Random multiple-access communication and group testing","volume":"32","author":"Berger","year":"1984","journal-title":"IEEE Transactions on Communications"},{"key":"2026032712273552600_ref024","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-16367-8_4","article-title":"Testing juntas: A brief survey","author":"Blais","year":"2010","journal-title":"Property Testing: Current research and surveys"},{"issue":"7","key":"2026032712273552600_ref025","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","article-title":"Space\/time trade-offs in hash coding with allowable errors","volume":"13","author":"Bloom","year":"1970","journal-title":"Communications of the ACM"},{"key":"2026032712273552600_ref026","article-title":"Sublinear-time non-adaptive group testing with O(k log n) tests via bit-mixing coding","author":"Bondorf","year":"2019"},{"key":"2026032712273552600_ref027","unstructured":"Bshouty, N. H.\n          . 2009. \u201cOptimal algorithms for the coin weighing problem with a spring scale\u201d. In: Conference on Learning Theory. url: https:\/\/www.cs.mcgill.ca\/~colt2009\/papers\/004.pdf."},{"key":"2026032712273552600_ref028","unstructured":"Bshouty, N. H.\n          . 2018. \u201cLower bound for non-adaptive estimate the number of defective items\u201d. In: Electronic Colloquium on Computational Complexity (ECCC). TR18-053. url: https:\/\/eccc.weizmann.ac.il\/report\/2018\/053\/."},{"key":"2026032712273552600_ref029","first-page":"93","article-title":"Adaptive group testing algorithms to estimate the number of defectives","volume":"83","author":"Bshouty","year":"2018","journal-title":"Proceedings of Algorithmic Learning Theory"},{"key":"2026032712273552600_ref030","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.tcs.2017.12.032","article-title":"Exact learning of juntas from membership queries","volume":"742","author":"Bshouty","year":"2018","journal-title":"Theoretical Computer Science"},{"key":"2026032712273552600_ref031","article-title":"Constructive methods to solve problems of s-surjectivity, conflict resolution, coding in defective memories","author":"Busschbach","year":"1984"},{"issue":"4","key":"2026032712273552600_ref032","doi-asserted-by":"publisher","first-page":"2113","DOI":"10.1109\/TIT.2017.2659619","article-title":"Efficient algorithms for noisy group testing","volume":"63","author":"Cai","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref033","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1109\/ALLERTON.2011.6120391","article-title":"Nonadaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms","volume-title":"49th Annual Allerton Conference on Communication, Control, and Computing","author":"Chan","year":"2011"},{"issue":"5","key":"2026032712273552600_ref034","doi-asserted-by":"publisher","first-page":"3019","DOI":"10.1109\/TIT.2014.2310477","article-title":"Non-adaptive group testing: Explicit bounds and novel algorithms","volume":"60","author":"Chan","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712273552600_ref035","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.2307\/2532446","article-title":"Using group testing to estimate a proportion, and to test the binomial model","volume":"46","author":"Chen","year":"1990","journal-title":"Biometrics"},{"issue":"1","key":"2026032712273552600_ref036","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10878-007-9083-3","article-title":"A survey on nonadaptive group testing algorithms through the angle of decoding","volume":"15","author":"Chen","year":"2008","journal-title":"Journal of Combinatorial Optimization"},{"issue":"5","key":"2026032712273552600_ref037","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/j.dam.2006.10.009","article-title":"Exploring the missing link among d-separable, d\u00af-separable and d-disjunct matrices","volume":"155","author":"Chen","year":"2007","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"2026032712273552600_ref038","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.orl.2011.07.001","article-title":"An efficient randomized group testing procedure to determine the number of defectives","volume":"39","author":"Cheng","year":"2011","journal-title":"Operations Research Letters"},{"issue":"1","key":"2026032712273552600_ref039","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/TIT.2011.2169535","article-title":"Graph-constrained group testing","volume":"58","author":"Cheraghchi","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref040","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-64203409- 1_7","article-title":"Noise-resilient group testing: Limitations and constructions","author":"Cheraghchi","year":"2009","journal-title":"International Symposium on Fundamentals of Computation Theory"},{"key":"2026032712273552600_ref041","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1109\/ALLERTON.2010.5707017","article-title":"Derandomization and group testing","volume-title":"48th Allerton Conference on Communication, Control, and Computing","author":"Cheraghchi","year":"2010"},{"issue":"3","key":"2026032712273552600_ref042","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/s00453-013-9754-7","article-title":"Improved constructions for non-adaptive threshold group testing","volume":"67","author":"Cheraghchi","year":"2013","journal-title":"Algorithmica"},{"issue":"3","key":"2026032712273552600_ref043","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"4","author":"Chvatal","year":"1979","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"2026032712273552600_ref044","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1504\/IJBRA.2005.008441","article-title":"Optimal group testing algorithms with interval queries and their application to splice site detection","volume":"1","author":"Cicalese","year":"2005","journal-title":"International Journal of Bioinformatics Research and Applications"},{"issue":"2","key":"2026032712273552600_ref045","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jcss.2009.06.002","article-title":"Pattern matching with don\u2019t cares and few errors","volume":"76","author":"Clifford","year":"2010","journal-title":"Journal of Computer and System Sciences"},{"key":"2026032712273552600_ref046","article-title":"Information-theoretic and algorithmic thresholds for group testing","author":"Coja-Oghlan","year":"2019"},{"key":"2026032712273552600_ref047","article-title":"Optimal non-adaptive group testing","author":"Coja-Oghlan","year":"2019"},{"key":"2026032712273552600_ref048","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2009","edition":"3rd"},{"issue":"1","key":"2026032712273552600_ref049","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/1061318.1061325","article-title":"What\u2019s hot and what\u2019s not: Tracking most frequent items dynamically","volume":"30","author":"Cormode","year":"2005","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"2026032712273552600_ref050","doi-asserted-by":"publisher","DOI":"10.1002\/047174882X","volume-title":"Elements of Information Theory","author":"Cover","year":"2006","edition":"2nd"},{"key":"2026032712273552600_ref051","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889","volume-title":"Information Theory: Coding theorems for discrete memoryless systems","author":"Csiszar","year":"2011","edition":"2nd"},{"issue":"1","key":"2026032712273552600_ref052","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1038\/sj.hdy.6882420","article-title":"Pooling DNA in the identification of parents","volume":"80","author":"Curnow","year":"1998","journal-title":"Heredity"},{"key":"2026032712273552600_ref053","article-title":"Lectures on designing screening experiments","author":"yachkov","year":"2004"},{"issue":"3","key":"2026032712273552600_ref054","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"yachkov","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"issue":"4","key":"2026032712273552600_ref055","first-page":"1","article-title":"A survey of superimposed code theory","volume":"12","author":"yachkov","year":"1983","journal-title":"Problems of Control and Information Theory"},{"key":"2026032712273552600_ref056","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/11889342_45","article-title":"Threshold group testing","author":"Damaschke","year":"2006","journal-title":"General Theory of Information Transfer and Combinatorics"},{"key":"2026032712273552600_ref057","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.dam.2016.01.010","article-title":"Adaptive group testing with a constrained number of positive responses improved","volume":"205","author":"Damaschke","year":"2016","journal-title":"Discrete Applied Mathematics"},{"key":"2026032712273552600_ref058","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-17461-2_10&gt;","article-title":"Bounds for non-adaptive group tests to estimate the amount of defectives","author":"Damaschke","year":"2010","journal-title":"Combinatorial Optimization and Applications (COCOA)"},{"issue":"03","key":"2026032712273552600_ref059","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1142\/S179383091000067X","article-title":"Competitive group testing and learning hidden vertex covers with minimum adaptivity","volume":"2","author":"Damaschke","year":"2010","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"key":"2026032712273552600_ref060","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-27660-6_18","article-title":"Randomized group testing both query-optimal and minimal adaptive","volume-title":"International Conference on Current Trends in Theory and Practice of Computer Science","author":"Damaschke","year":"2012"},{"issue":"5","key":"2026032712273552600_ref061","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539703428002","article-title":"Optimal two- stage algorithms for group testing problems","volume":"34","author":"De Bonis","year":"2005","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"2026032712273552600_ref062","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0020-0190(98)00088-X","article-title":"Improved algorithms for group testing with inhibitors","volume":"67","author":"De Bonis","year":"1998","journal-title":"Information Processing Letters"},{"issue":"1-3","key":"2026032712273552600_ref063","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(03)00281-0","article-title":"Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels","volume":"306","author":"De Bonis","year":"2003","journal-title":"Theoretical Computer Science"},{"issue":"11","key":"2026032712273552600_ref064","doi-asserted-by":"publisher","first-page":"7304","DOI":"10.1109\/TIT.2017.2750178","article-title":"\u03f5-almost selectors and their applications to multiple-access communication","volume":"63","author":"Bonis","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026032712273552600_ref065","doi-asserted-by":"publisher","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":"The Annals of Mathematical Statistics"},{"key":"2026032712273552600_ref066","doi-asserted-by":"publisher","DOI":"10.1142\/4252","volume-title":"Combinatorial Group Testing and Its Applications","author":"Du","year":"1999","edition":"2nd"},{"key":"2026032712273552600_ref067","doi-asserted-by":"publisher","DOI":"10.1142\/6122","volume-title":"Pooling Designs and Non-adaptive Group Testing: Important tools for DNA sequencing","author":"Du","year":"2006"},{"key":"2026032712273552600_ref068","doi-asserted-by":"publisher","first-page":"3335","DOI":"10.1109\/ICASSP.2014.6854218","article-title":"Poisson group testing: A probabilistic model for nonadaptive streaming Boolean compressed sensing","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2014","author":"Emad","year":"2014"},{"issue":"8","key":"2026032712273552600_ref069","doi-asserted-by":"publisher","first-page":"4614","DOI":"10.1109\/TIT.2014.2327630","article-title":"Semiquantitative group testing","volume":"60","author":"Emad","year":"2014","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref070","unstructured":"Emad, A., K. R.Varshney, and D. M.Malioutov. 2015. \u201cA semi- quantitative group testing approach for learning interpretable clinical prediction rules\u201d. In: Signal Processing with Adaptive Sparse Structured Representations (SPARS). url: https:\/\/krvarshney.github.io\/pubs\/EmadVM_spars2015.pdf."},{"key":"2026032712273552600_ref071","first-page":"215","article-title":"On a classical problem of probability theory","volume":"6","author":"Erdos","year":"1961","journal-title":"A Magyar Tudomdnyos Akademia Matematikai Kutato Intezetenek Kozlemenyei"},{"key":"2026032712273552600_ref072","first-page":"229","article-title":"On two problems of information theory","volume":"8","author":"Erdos","year":"1963","journal-title":"A Magyar Tudomdnyos Akademia Matematikai Kutato Intezetenek Kozlemenyei"},{"issue":"2","key":"2026032712273552600_ref073","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1109\/TIT.2009.2037043","article-title":"Compressed genotyping","volume":"56","author":"Erlich","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref074","doi-asserted-by":"publisher","DOI":"10.1101\/035352","article-title":"Biological screens from linear codes: Theory and tools","volume-title":"bioRxiv","author":"Erlich","year":"2015"},{"key":"2026032712273552600_ref075","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1109\/ISIT.2016.7541524","article-title":"Estimating the number of defectives with group testing","author":"Falahatgar","year":"2016","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"2026032712273552600_ref076","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/SEQUEN.1997.666930","article-title":"Group testing problems with sequences in experimental molecular biology","author":"Farach","year":"1997","journal-title":"Proceedings of Compression and Complexity of SEQUENCES 1997"},{"issue":"4","key":"2026032712273552600_ref077","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TIT.1954.1057459","article-title":"A new basic theorem of information theory","volume":"4","author":"Feinstein","year":"1954","journal-title":"Transactions of the IRE Professional Group on Information Theory"},{"key":"2026032712273552600_ref078","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller","year":"1968","edition":"3rd"},{"key":"2026032712273552600_ref079","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2307\/2985222","article-title":"The blood testing problem","author":"Finucan","year":"1964","journal-title":"Journal of the Royal Statistical Society Series C (Applied Statistics)"},{"issue":"1","key":"2026032712273552600_ref080","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(98)00119-X","article-title":"On the cut-off point for combinatorial group testing","volume":"91","author":"Fischer","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"2026032712273552600_ref081","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-81764948-7","volume-title":"A Mathematical Introduction to Compressive Sensing","author":"Foucart","year":"2013"},{"issue":"1","key":"2026032712273552600_ref082","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/1120008","article-title":"On a design problem for screening experiments","volume":"20","author":"Freidlina","year":"1975","journal-title":"Teoriya Veroyatnostei i ee Primeneniya"},{"issue":"1","key":"2026032712273552600_ref083","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/jcta.1996.0012","article-title":"On r-cover-free families","volume":"73","author":"Furedi","year":"1996","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"2026032712273552600_ref084","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/WIFS.2012.6412647","article-title":"Decoding fingerprints using the Markov Chain Monte Carlo method","author":"Furon","year":"2012","journal-title":"IEEE International Workshop on Information Forensics and Security (WIFS)"},{"key":"2026032712273552600_ref085","unstructured":"Furon, T.\n          . 2018. \u201cThe illusion of group testing\u201d. Tech. rep. No. RR- 9164. InriaRennes Bretagne Atlantique. url: https:\/\/hal.inria.fr\/hal-01744252."},{"key":"2026032712273552600_ref086","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/ALLERTON.2016.7852259","article-title":"Nearly optimal sparse group testing","volume-title":"54th Annual Al lerton Conference on Communication, Control, and Computing","author":"Gandikota","year":"2016"},{"key":"2026032712273552600_ref087","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/ISIT.2015.7282418","article-title":"Learning immune-defectives graph through group tests","author":"Ganesan","year":"2015","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"2026032712273552600_ref088","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ITW.2015.7133108","article-title":"Non-adaptive group testing with inhibitors","author":"Ganesan","year":"2015","journal-title":"2015 IEEE Information Theory Workshop (ITW)"},{"issue":"345","key":"2026032712273552600_ref089","doi-asserted-by":"publisher","first-page":"151","DOI":"10.2307\/2285514","article-title":"Isolating a single defective using group testing","volume":"69","author":"Garey","year":"1974","journal-title":"Journal of the American Statistical Association"},{"issue":"1","key":"2026032712273552600_ref090","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0378-3758(89)90061-X","article-title":"Estimation of the prevalence of a rare disease, preserving the anonymity of the subjects by group testing: Application to estimating the prevalence of AIDS antibodies in blood donors","volume":"22","author":"Gastwirth","year":"1989","journal-title":"Journal of Statistical Planning and Inference"},{"key":"2026032712273552600_ref091","article-title":"Quantitative group testing in the sublinear regime","author":"Gebhard","year":"2019"},{"key":"2026032712273552600_ref092","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/ITA.2012.6181772","article-title":"Recovering simple signals","author":"Gilbert","year":"2012","journal-title":"2012 Information Theory and Applications Workshop (ITA)"},{"key":"2026032712273552600_ref093","article-title":"Algorithmic linear dimension reduction in the l1 norm for sparse vectors","volume-title":"Allerton Conference on Communication, Control, and Computing","author":"Gilbert","year":"2006"},{"key":"2026032712273552600_ref094","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/1250790.1250824","article-title":"One sketch for all: Fast algorithms for compressed sensing","author":"Gilbert","year":"2007","journal-title":"Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing (STOC \u201907)"},{"key":"2026032712273552600_ref095","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1109\/ACSSC.2008.5074574","article-title":"Group testing and sparse signal recovery","volume-title":"2008 42nd Asilomar Conference on Signals, Systems and Computers","author":"Gilbert","year":"2008"},{"issue":"3","key":"2026032712273552600_ref096","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00202411","article-title":"A pooling strategy for heterozygote screening of the AF508 cystic fibrosis mutation","volume":"86","author":"Gille","year":"1991","journal-title":"Human Genetics"},{"key":"2026032712273552600_ref097","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172448","volume-title":"Communication Theory","author":"Goldie","year":"1991"},{"key":"2026032712273552600_ref098","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/11496137_15","article-title":"Indexing information for data forensics","author":"Goodrich","year":"2005","journal-title":"Applied Cryptography and Network Security"},{"issue":"1","key":"2026032712273552600_ref099","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10878-007-9087-z","article-title":"Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis","volume":"15","author":"Goodrich","year":"2008","journal-title":"Journal of Combinatorial Optimization"},{"key":"2026032712273552600_ref100","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12066-8","volume-title":"Information-Spectrum Methods in Information Theory","author":"Han","year":"2003"},{"key":"2026032712273552600_ref101","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1109\/INFCOM.2007.87","article-title":"Non-adaptive fault diagnosis for all-optical networks via combinatorial group testing on graphs","volume-title":"26th IEEE International Conference on Computer Communications (INFO- COM)","author":"Harvey","year":"2007"},{"issue":"8","key":"2026032712273552600_ref102","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1109\/TCOM.1978.1094204","article-title":"An adaptive technique for local distribution","volume":"26","author":"Hayes","year":"1978","journal-title":"IEEE Transactions on Communications"},{"issue":"8","key":"2026032712273552600_ref103","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/TIP.2002.801124","article-title":"Group testing for image compression","volume":"11","author":"Hong","year":"2002","journal-title":"IEEE Transactions on Image Processing"},{"key":"2026032712273552600_ref104","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1109\/ACSSC.2004.1399362","article-title":"Group testing for sensor networks: The value of asking the right questions","volume-title":"38th Asilomar Conference on Signals, Systems and Computers","author":"Hong","year":"2004"},{"issue":"2","key":"2026032712273552600_ref105","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1137\/0602011","article-title":"A boundary problem for group testing","volume":"2","author":"Hu","year":"1981","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"8","key":"2026032712273552600_ref106","doi-asserted-by":"publisher","first-page":"5050","DOI":"10.1109\/TIT.2019.2906607","article-title":"Blind group testing","volume":"65","author":"Huleihel","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"339","key":"2026032712273552600_ref107","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/01621459.1972.10481257","article-title":"A method for detecting all defective members in a population by group testing","volume":"67","author":"Hwang","year":"1972","journal-title":"Journal of the American Statistical Association"},{"issue":"352","key":"2026032712273552600_ref108","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1080\/01621459.1975.10480324","article-title":"A generalized binomial group testing problem","volume":"70","author":"Hwang","year":"1975","journal-title":"Journal of the American Statistical Association"},{"key":"2026032712273552600_ref109","doi-asserted-by":"crossref","DOI":"10.1109\/ALLERTON.2018.8635972","article-title":"On the optimality of the Kautz-Singleton construction in probabilistic group testing","author":"Inan","year":"2018"},{"key":"2026032712273552600_ref110","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1109\/SFCS.1997.646101","article-title":"Deterministic superimposed coding with applications to pattern matching","author":"Indyk","year":"1997","journal-title":"38th Annual Symposium on Foundations of Computer Science (FOCS)"},{"key":"2026032712273552600_ref111","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/1.9781611973075.91","article-title":"Efficiently decodable non-adaptive group testing","author":"Indyk","year":"2010","journal-title":"21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"issue":"1-3","key":"2026032712273552600_ref112","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0166-218X(01)00181-0","article-title":"A group testing problem for graphs with several defective edges","volume":"117","author":"Johann","year":"2002","journal-title":"Discrete Applied Mathematics"},{"issue":"9","key":"2026032712273552600_ref113","doi-asserted-by":"publisher","first-page":"5923","DOI":"10.1109\/TIT.2017.2697358","article-title":"Strong converses for group testing from finite blocklength results","volume":"63","author":"Johnson","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026032712273552600_ref114","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/TIT.2018.2861772","article-title":"Performance of group testing algorithms with near-constant tests-per-item","volume":"65","author":"Johnson","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712273552600_ref115","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TCAD.2005.854635","article-title":"New and improved BIST diagnosis methods from combinatorial group testing theory","volume":"25","author":"Kahng","year":"2006","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"3","key":"2026032712273552600_ref116","first-page":"339","article-title":"Pooling in high- throughput drug screening","volume":"12","author":"Kainkaryam","year":"2009","journal-title":"Current Opinion on Drug Discovery and Development"},{"key":"2026032712273552600_ref117","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972","journal-title":"Complexity of Computer Computations"},{"issue":"5","key":"2026032712273552600_ref118","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1093\/infdis\/172.5.1414","article-title":"Determining the prevalence of Onchocerca volvulus infection in vector populations by polymerase chain reaction screening of pools of black flies","volume":"172","author":"Katholi","year":"1995","journal-title":"Journal of Infectious Diseases"},{"key":"2026032712273552600_ref119","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/B978-0-7204-2262-7.50028-4","article-title":"Combinatorial search problems","author":"Katona","year":"1973","journal-title":"A Survey of Combinatorial Theory"},{"issue":"4","key":"2026032712273552600_ref120","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Nonrandom binary superimposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref121","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/ALLERTON.2014.7028442","article-title":"The capacity of non-identical adaptive group testing","volume-title":"52nd Annual Allerton Conference on Communication, Control, and Computing","author":"Kealy","year":"2014"},{"issue":"1","key":"2026032712273552600_ref122","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1186\/s13071-016-1948-9","article-title":"Detection of West Nile virus in six mosquito species in synchrony with seroconversion among sentinel chickens in India","volume":"10","author":"Khan","year":"2017","journal-title":"Parasites and Vectors"},{"key":"2026032712273552600_ref123","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/INFOCOM.2008.43","article-title":"Live baiting for service-level DoS attackers","volume-title":"27th IEEE International Conference on Computer Communications (INFOCOM)","author":"Khattab","year":"2008"},{"key":"2026032712273552600_ref124","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1089\/cmb.1996.3.395","article-title":"Interpretation of pooling experiments using the Markov chain Monte Carlo method","volume":"3","author":"Knill","year":"1996","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"2026032712273552600_ref125","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","article-title":"An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels","volume":"31","author":"Komlos","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"2026032712273552600_ref126","doi-asserted-by":"publisher","first-page":"1967","DOI":"10.1109\/TIFS.2015.2440190","article-title":"Asymptotics of fingerprinting and group testing: Tight bounds from channel capacities","volume":"10","author":"Laarhoven","year":"2015","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"2026032712273552600_ref127","article-title":"SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes","author":"Lee","year":"2015"},{"issue":"298","key":"2026032712273552600_ref128","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1080\/01621459.1962.10480672","article-title":"A sequential method for screening experimental variables","volume":"57","author":"Li","year":"1962","journal-title":"Journal of the American Statistical Association"},{"key":"2026032712273552600_ref129","doi-asserted-by":"publisher","first-page":"2346","DOI":"10.1109\/ISIT.2014.6875253","article-title":"Group testing with prior statistics","author":"Li","year":"2014","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"2026032712273552600_ref130","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1109\/ISIT.2015.7282735","article-title":"Sub-linear time compressed sensing using sparse-graph codes","author":"Li","year":"2015","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"2026032712273552600_ref131","article-title":"Learning Erdos- Renyi random graphs via edge detecting queries","author":"Li","year":"2019"},{"key":"2026032712273552600_ref132","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/DCOSS.2013.57","article-title":"Efficient sensor fault detection using combinatorial group testing","volume-title":"IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS)","author":"Lo","year":"2013"},{"key":"2026032712273552600_ref133","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1109\/ALLERTON.2008.4797638","article-title":"Neighbor discovery in wireless ad hoc networks based on group testing","volume-title":"46th Annual Al lerton Conference on Communication, Control, and Computing","author":"Luo","year":"2008"},{"key":"2026032712273552600_ref134","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/2663716.2663723","article-title":"Node failure localization via network tomography","volume-title":"Proceedings of the 2014 Conference on Internet Measurement Conference (IMC)","author":"Ma","year":"2014"},{"key":"2026032712273552600_ref135","doi-asserted-by":"publisher","DOI":"10.2277\/0521642981","volume-title":"Information Theory, Inference and Learning Algorithms","author":"MacKay","year":"2003"},{"issue":"4","key":"2026032712273552600_ref136","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1009732820981","article-title":"Probabilistic nonadaptive and two-stage group testing with relatively small pools and DNA library screening","volume":"2","author":"Macula","year":"1998","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"2026032712273552600_ref137","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01609876","article-title":"Probabilistic nonadaptive group testing in the presence of errors and DNA library screening","volume":"3","author":"Macula","year":"1999","journal-title":"Annals of Combinatorics"},{"issue":"1","key":"2026032712273552600_ref138","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.dam.2003.07.009","article-title":"A group testing method for finding patterns in data","volume":"144","author":"Macula","year":"2004","journal-title":"Discrete Applied Mathematics"},{"key":"2026032712273552600_ref139","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1109\/ICDCS.1989.37952","article-title":"An application of group testing to the file comparison problem","volume-title":"9th International Conference on Distributed Computing Systems","author":"Madej","year":"1989"},{"key":"2026032712273552600_ref140","doi-asserted-by":"publisher","first-page":"3305","DOI":"10.1109\/ICASSP.2012.6288622","article-title":"Boolean compressed sensing: LP relaxation for group testing","volume-title":"2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","author":"Malioutov","year":"2012"},{"key":"2026032712273552600_ref141","first-page":"765","article-title":"Exact rule learning via Boolean compressed sensing","volume-title":"Proceedings of the 30th International Conference on Machine Learning","author":"Malioutov","year":"2013"},{"key":"2026032712273552600_ref142","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-54024-5_5","article-title":"Learning interpretable classification rules with Boolean compressed sensing","author":"Malioutov","year":"2017","journal-title":"Transparent Data Mining for Big and Small Data"},{"issue":"1","key":"2026032712273552600_ref143","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01104893","article-title":"The separating property of random matrices","volume":"23","author":"Malyutov","year":"1978","journal-title":"Matematicheskie Zametki"},{"key":"2026032712273552600_ref144","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-642-36899-8_31","article-title":"Search for sparse active inputs: A review","author":"Malyutov","year":"2013","journal-title":"Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede"},{"issue":"1","key":"2026032712273552600_ref145","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01149816","article-title":"Planning of screening experiments for a nonsymmetric response function","volume":"27","author":"Malyutov","year":"1980","journal-title":"Matem- aticheskie Zametki"},{"issue":"4","key":"2026032712273552600_ref146","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1515\/rose.1998.6.4.311","article-title":"Maximization of ESI. Jaynes principle in testing significant inputs of linear model","volume":"6","author":"Malyutov","year":"1998","journal-title":"Random Operators and Stochastic Equations"},{"issue":"12","key":"2026032712273552600_ref147","doi-asserted-by":"publisher","first-page":"7522","DOI":"10.1109\/TIT.2016.2613870","article-title":"Nonadaptive group testing with random set of defectives","volume":"62","author":"Mazumdar","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref148","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1017\/CBO9781107359949.008","article-title":"On the method of bounded differences","author":"McDiarmid","year":"1989","journal-title":"Surveys in Combinatorics 1989: Invited Papers at the Twelfth British Combinatorial Conference"},{"issue":"5","key":"2026032712273552600_ref149","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s10955-008-9528-9","article-title":"Group testing with random pools: Phase transitions and optimal strategy","volume":"131","author":"Mezard","year":"2008","journal-title":"Journal of Statistical Physics"},{"issue":"3","key":"2026032712273552600_ref150","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1109\/TIT.2010.2103752","article-title":"Group testing with random pools: Optimal two-stage algorithms","volume":"57","author":"Mezard","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712273552600_ref151","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/j.jcss.2004.04.002","article-title":"Learning functions of k relevant variables","volume":"69","author":"Mossel","year":"2004","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"2026032712273552600_ref152","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1109\/TCBB.2013.129","article-title":"Designing pooling systems for noisy high-throughput protein-protein interaction experiments using Boolean compressed sensing","volume":"10","author":"Mourad","year":"2013","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"2026032712273552600_ref153","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/B978-0-12-154050-0.50020-4","article-title":"Finite and infinite models for generalized group-testing with unequal probabilities of success for each item","author":"Nebenzahl","year":"1973","journal-title":"Discriminant Analysis and Applications"},{"key":"2026032712273552600_ref154","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-22006-7_47","article-title":"Efficiently decodable error-correcting list disjunct matrices and applications","author":"Ngo","year":"2011","journal-title":"Automata, Languages and Programming (ICALP)"},{"issue":"5","key":"2026032712273552600_ref155","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","article-title":"Channel coding rate in the finite blocklength regime","volume":"56","author":"Polyanskiy","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"2026032712273552600_ref156","doi-asserted-by":"publisher","first-page":"7982","DOI":"10.1109\/TIT.2011.2163296","article-title":"Explicit nonadaptive combinatorial group testing schemes","volume":"57","author":"Porat","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref157","article-title":"Understanding phase transitions via mutual information and MMSE","author":"Reeves","year":"2019"},{"issue":"4","key":"2026032712273552600_ref158","doi-asserted-by":"publisher","first-page":"669","DOI":"10.11650\/twjm\/1500407300","article-title":"Sharper bounds in adaptive group testing","volume":"4","author":"Riccio","year":"2000","journal-title":"Taiwanese Journal of Mathematics"},{"key":"2026032712273552600_ref159","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338","volume-title":"Modern Coding Theory","author":"Richardson","year":"2008"},{"issue":"2","key":"2026032712273552600_ref160","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","article-title":"On the upper bound of the size of the r-cover-free families","volume":"66","author":"Ruszinko","year":"1994","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"2026032712273552600_ref161","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2019.8849310","article-title":"An efficient algorithm for capacity-approaching noisy adaptive group testing","volume-title":"IEEE International Symposium on Information Theory (ISIT)","author":"Scarlett","year":"2019"},{"issue":"6","key":"2026032712273552600_ref162","doi-asserted-by":"publisher","first-page":"3646","DOI":"10.1109\/TIT.2018.2883604","article-title":"Noisy adaptive group testing: Bounds and algorithms","volume":"65","author":"Scarlett","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref163","doi-asserted-by":"publisher","first-page":"2868","DOI":"10.1109\/ISIT.2016.7541823","article-title":"Converse bounds for noisy group testing with arbitrary measurement matrices","author":"Scarlett","year":"2016","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"key":"2026032712273552600_ref164","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1137\/1.9781611974331.ch4","article-title":"Phase transitions in group testing","author":"Scarlett","year":"2016","journal-title":"27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"2026032712273552600_ref165","doi-asserted-by":"publisher","first-page":"6090","DOI":"10.1109\/ICASSP.2017.7953326","article-title":"How little does non-exact recovery help in group testing?","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","author":"Scarlett","year":"2017"},{"issue":"1","key":"2026032712273552600_ref166","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/TIT.2016.2606605","article-title":"Limits on support recovery With probabilistic models: An information-theoretic framework","volume":"63","author":"Scarlett","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref167","unstructured":"Scarlett, J. and V.Cevher. 2017c. \u201cPhase transitions in the pooled data problem\u201d. In: Advances in Neural Information Processing Systems 30 (NIPS 2017). 377\u2013385. url: https:\/\/papers.nips.cc\/paper\/6641-phase-transitions-in-the-pooled-data-problem."},{"issue":"4","key":"2026032712273552600_ref168","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1109\/JSTSP.2018.2844818","article-title":"Near-optimal noisy group testing via separate decoding of items","volume":"2","author":"Scarlett","year":"2018","journal-title":"IEEE Journal of Selelected Topics in Signal Processing"},{"key":"2026032712273552600_ref169","article-title":"Noisy non-adaptive group testing: A (near-)definite defectives approach","author":"Scarlett","year":"2018"},{"key":"2026032712273552600_ref170","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1109\/CSB.2003.1227307","article-title":"Group testing with DNA chips: Generating designs and decoding experiments","volume-title":"IEEE Bioinformatics Conference","author":"Schliep","year":"2003"},{"issue":"1","key":"2026032712273552600_ref171","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0378-3758(85)90022-9","article-title":"On two random search problems","volume":"11","author":"Sebo","year":"1985","journal-title":"Journal of Statistical Planning and Inference"},{"key":"2026032712273552600_ref172","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1109\/ALLERTON.2010.5707018","article-title":"Note on noisy group testing: Asymptotic bounds and belief propagation reconstruction","volume-title":"48th Annual Al lerton Conference on Communication, Control, and Computing","author":"Sejdinovic","year":"2010"},{"issue":"11","key":"2026032712273552600_ref173","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1038\/nrg930","article-title":"DNA pooling: A tool for large-scale association studies","volume":"3","author":"Sham","year":"2002","journal-title":"Nature Reviews Genetics"},{"issue":"12","key":"2026032712273552600_ref174","doi-asserted-by":"publisher","first-page":"7518","DOI":"10.1109\/TIT.2016.2614726","article-title":"New bounds on the number of tests for disjunct matrices","volume":"62","author":"Shangguan","year":"2016","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026032712273552600_ref175","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Transactions on Information Theory"},{"issue":"1","key":"2026032712273552600_ref176","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/S0019-9958(57)90039-6","article-title":"Certain results in coding theory for noisy channels","volume":"1","author":"Shannon","year":"1957","journal-title":"Information and Control"},{"issue":"8","key":"2026032712273552600_ref177","doi-asserted-by":"publisher","first-page":"3794","DOI":"10.1109\/TVT.2014.2305978","article-title":"Group testing-based spectrum hole search for cognitive radios","volume":"63","author":"Sharma","year":"2014","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"19","key":"2026032712273552600_ref178","doi-asserted-by":"publisher","first-page":"e179","DOI":"10.1093\/nar\/gkq675","article-title":"Identification of rare alleles and their carriers using compressed se(que)nsing","volume":"38","author":"Shental","year":"2010","journal-title":"Nucleic Acids Research"},{"key":"2026032712273552600_ref179","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/2647868.2654895","article-title":"A group testing framework for similarity search in high-dimensional spaces","volume-title":"Proceedings of the ACM International Conference on Multimedia","author":"Shi","year":"2014"},{"key":"2026032712273552600_ref180","doi-asserted-by":"publisher","first-page":"181","DOI":"10.2307\/2334502","article-title":"Group testing with a new goal, estimation","author":"Sobel","year":"1975","journal-title":"Biometrika"},{"issue":"5","key":"2026032712273552600_ref181","doi-asserted-by":"publisher","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":"38","author":"Sobel","year":"1959","journal-title":"Bell Labs Technical Journal"},{"issue":"4","key":"2026032712273552600_ref182","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1080\/00401706.1966.10490408","article-title":"Binomial group-testing with an unknown proportion of defectives","volume":"8","author":"Sobel","year":"1966","journal-title":"Technometrics"},{"issue":"6","key":"2026032712273552600_ref183","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","article-title":"Linear-time encodable and decodable error-correcting codes","volume":"42","author":"Spielman","year":"1996","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"2026032712273552600_ref184","doi-asserted-by":"publisher","first-page":"1940","DOI":"10.1109\/JPROC.2003.818327","article-title":"Molecular electronics: From devices and interconnect to circuits and architecture","volume":"91","author":"Stan","year":"2003","journal-title":"Proceedings of the IEEE"},{"issue":"4","key":"2026032712273552600_ref185","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1214\/aoms\/1177706807","article-title":"On the detection of defective members of large populations","volume":"28","author":"Sterrett","year":"1957","journal-title":"The Annals of Mathematical Statistics"},{"issue":"8","key":"2026032712273552600_ref186","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1094\/Phyto-75-882","article-title":"Group testing for estimating infection rates and probabilities of disease transmission","volume":"75","author":"Swallow","year":"1985","journal-title":"Phytopathology"},{"issue":"4","key":"2026032712273552600_ref187","doi-asserted-by":"publisher","first-page":"568","DOI":"10.2307\/2527902","article-title":"Estimation of the proportion of vectors in a natural population of insects","volume":"18","author":"Thompson","year":"1962","journal-title":"Biometrics"},{"issue":"3","key":"2026032712273552600_ref188","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1097\/QAI.0000000000000724","article-title":"Pooled nucleic acid testing to detect antiretroviral treatment failure in HIV-infected patients in Mozambique","volume":"70","author":"Tilghman","year":"2015","journal-title":"Journal of Acquired Immune Deficiency Syndromes"},{"issue":"1","key":"2026032712273552600_ref189","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1002\/mana.19821090103","article-title":"Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound","volume":"109","author":"Tsfasman","year":"1982","journal-title":"Mathematische Nachrichten"},{"key":"2026032712273552600_ref190","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2307\/2337408","article-title":"On the informativeness and accuracy of pooled testing in estimating prevalence of a rare disease: Application to HIV screening","author":"Tu","year":"1995","journal-title":"Biometrika"},{"issue":"4","key":"2026032712273552600_ref191","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1109\/18.391251","article-title":"Group detection for synchronous Gaussian code-division multiple-access channels","volume":"41","author":"Varanasi","year":"1995","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref192","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"Vazirani","year":"2001"},{"issue":"3","key":"2026032712273552600_ref193","doi-asserted-by":"publisher","first-page":"1525","DOI":"10.1109\/TIT.2016.2621112","article-title":"Nonadaptive group testing based on sparse pooling graphs","volume":"63","author":"Wadayama","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"2026032712273552600_ref194","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TIT.2018.2827463","article-title":"Comments on \u2018Nonadaptive group testing based on sparse pooling graphs\u2019","volume":"64","author":"Wadayama","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026032712273552600_ref195","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/oxfordjournals.aje.a112961","article-title":"Estimation of infection rates in populations of organisms using pools of variable size","volume":"112","author":"Walter","year":"1980","journal-title":"American Journal of Epidemiology"},{"issue":"4","key":"2026032712273552600_ref196","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1109\/TSP.2017.2780053","article-title":"Optimal nested test plan for combinatorial quantitative group testing","volume":"66","author":"Wang","year":"2018","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"10","key":"2026032712273552600_ref197","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1109\/TKDE.2012.178","article-title":"Identifying the most connected vertices in hidden bipartite graphs using group testing","volume":"25","author":"Wang","year":"2013","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"2026032712273552600_ref198","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TIT.1985.1057026","article-title":"Born again group testing: Multiaccess communications","volume":"31","author":"Wolf","year":"1985","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref199","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1109\/ISIT.2014.6875024","article-title":"Achievable partition information rate over noisy multi-access Boolean channel","author":"Wu","year":"2014","journal-title":"IEEE International Symposium on Information Theory (ISIT)"},{"issue":"2","key":"2026032712273552600_ref200","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/TIT.2014.2375211","article-title":"Partition information and its transmission over Boolean multiaccess channels","volume":"61","author":"Wu","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026032712273552600_ref201","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/ACSSC.2011.6190031","article-title":"Recent results on sparse recovery over graphs","volume-title":"45th Asilomar Conference on Signals, Systems and Computers","author":"Xu","year":"2011"},{"issue":"8","key":"2026032712273552600_ref202","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TPDS.2009.147","article-title":"Detecting application denial-of-service attacks: A group-testing-based approach","volume":"21","author":"Xuan","year":"2010","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"2026032712273552600_ref203","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1017\/S0269964816000267","article-title":"Asymptotic analysis of optimal nested group-testing procedures","volume":"30","author":"Zaman","year":"2016","journal-title":"Probability in the Engineering and Informational Sciences"},{"key":"2026032712273552600_ref204","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1109\/ISIT.2017.8007007","article-title":"On OR many-access channels","author":"Zhang","year":"2017","journal-title":"IEEE International Symposium on Information Theory (ISIT)"}],"container-title":["Foundations and Trends\u00ae in Communications and Information Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/15\/3-4\/196\/11153357\/0100000099en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftcit\/article-pdf\/15\/3-4\/196\/11153357\/0100000099en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:10:35Z","timestamp":1777471835000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftcit\/article\/15\/3-4\/196\/1332362\/Group-Testing-An-Information-Theory-Perspective"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,5]]},"references-count":204,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2019,12,5]]}},"URL":"https:\/\/doi.org\/10.1561\/0100000099","relation":{},"ISSN":["1567-2190","1567-2328"],"issn-type":[{"value":"1567-2190","type":"print"},{"value":"1567-2328","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,5]]}}}