{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:40:58Z","timestamp":1742946058705,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031047480"},{"type":"electronic","value":"9783031047497"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-04749-7_8","type":"book-chapter","created":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T16:13:24Z","timestamp":1652285604000},"page":"126-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Real-Valued Group Testing for\u00a0Quantitative Molecular Assays"],"prefix":"10.1007","author":[{"given":"Seyran","family":"Saeedi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myrna","family":"Serrano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis G.","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Paul","family":"Brooks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory A.","family":"Buck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Arodz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,29]]},"reference":[{"issue":"6","key":"8_CR1","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1093\/ajcp\/aqaa064","volume":"153","author":"B Abdalhamid","year":"2020","unstructured":"Abdalhamid, B., Bilder, C.R., McCutchen, E.L., Hinrichs, S.H., Koepsell, S.A., Iwen, P.C.: Assessment of specimen pooling to conserve SARS CoV-2 testing resources. Am. J. Clin. Pathol. 153(6), 715\u2013718 (2020)","journal-title":"Am. J. Clin. Pathol."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Aldridge, M., Johnson, O., Scarlett, J., et al.: Group testing: an information theory perspective. Found. Trends Commun. Inf. Theory 15(3\u20134), 196\u2013392 (2019)","DOI":"10.1561\/0100000099"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1109\/TIT.2011.2178156","volume":"58","author":"GK Atia","year":"2012","unstructured":"Atia, G.K., Saligrama, V.: Boolean compressed sensing and noisy group testing. IEEE Trans. Inf. Theory 58(3), 1880\u20131901 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Berinde, R., Gilbert, A.C., Indyk, P., Karloff, H., Strauss, M.J.: Combining geometry and combinatorics: a unified approach to sparse signal recovery. In: 46th Annual Allerton Conference on Communication, Control, and Computing, pp. 798\u2013805. IEEE (2008)","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Bruckstein, A.M., Elad, M., Zibulevsky, M.: On the uniqueness of non-negative sparse & redundant representations. In: 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 5145\u20135148. IEEE (2008)","DOI":"10.1109\/ICASSP.2008.4518817"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Candes, E.J., Romberg, J.K., Tao, T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","DOI":"10.1002\/cpa.20124"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Chan, C.L., Che, P.H., Jaggi, S., Saligrama, V.: Non-adaptive probabilistic group testing with noisy measurements: near-optimal bounds with efficient algorithms. In: 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1832\u20131839. IEEE (2011)","DOI":"10.1109\/Allerton.2011.6120391"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cleary, B., et al.: Using viral load and epidemic dynamics to optimize pooled testing in resource-constrained settings. Sci. Transl. Med. 13(589) (2021)","DOI":"10.1126\/scitranslmed.abf1568"},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0894-0347-08-00610-3","volume":"22","author":"A Cohen","year":"2009","unstructured":"Cohen, A., Dahmen, W., DeVore, R.: Compressed sensing and best $$k$$-term approximation. J. Am. Math. Soc. 22(1), 211\u2013231 (2009)","journal-title":"J. Am. Math. Soc."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Corman, V.M., et al.: Detection of 2019 novel coronavirus (2019-nCoV) by real-time RT-PCR. Eurosurveillance 25(3), 2000045 (2020)","DOI":"10.2807\/1560-7917.ES.2020.25.3.2000045"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"27","key":"8_CR12","doi-asserted-by":"publisher","first-page":"9446","DOI":"10.1073\/pnas.0502269102","volume":"102","author":"DL Donoho","year":"2005","unstructured":"Donoho, D.L., Tanner, J.: Sparse nonnegative solution of underdetermined linear equations by linear programming. Proc. Natl. Acad. Sci. 102(27), 9446\u20139451 (2005)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. Ann. Math. Stat. 14(4), 436\u2013440 (1943)","journal-title":"Ann. Math. Stat."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Du, D., Hwang, F.K., Hwang, F.: Combinatorial Group Testing and Its Applications. World Scientific, River Edge (2000)","DOI":"10.1142\/4252"},{"key":"8_CR15","unstructured":"D\u2019yachkov, A.G., Rykov, V.V.: Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii 18(3), 7\u201313 (1982)"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer-Verlag, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7","DOI":"10.1007\/978-3-642-16533-7"},{"issue":"5","key":"8_CR17","doi-asserted-by":"publisher","first-page":"2760","DOI":"10.1109\/TIT.2019.2891651","volume":"65","author":"V Gandikota","year":"2019","unstructured":"Gandikota, V., Grigorescu, E., Jaggi, S., Zhou, S.: Nearly optimal sparse group testing. IEEE Trans. Inf. Theory 65(5), 2760\u20132773 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR18","unstructured":"Gebhard, O., Hahn-Klimroth, M., Parczyk, O., Penschuck, M., Rolvien, M.: Near optimal sparsity-constrained group testing: improved bounds and algorithms. arXiv:2004.11860 (2020)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Ghosh, S., et al.: A compressed sensing approach to pooled RT-PCR testing for Covid-19 detection. IEEE Open J. Signal Process. 2, 248\u2013264 (2021)","DOI":"10.1109\/OJSP.2021.3075913"},{"key":"8_CR20","unstructured":"Gurobi Optimization, L.: Gurobi Optimizer Reference Manual (2020). http:\/\/www.gurobi.com"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Heidarzadeh, A., Narayanan, K.R.: Two-stage adaptive pooling with RT-qPCR for COVID-19 screening. arXiv:2007.02695 (2020)","DOI":"10.1101\/2020.07.05.20146936"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-003-0385-7","volume":"96","author":"R Hemmecke","year":"2003","unstructured":"Hemmecke, R.: On the positive sum property and the computation of Graver test sets. Math. Program. Ser. B 96, 247\u2013269 (2003)","journal-title":"Math. Program. Ser. B"},{"issue":"4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W Kautz","year":"1964","unstructured":"Kautz, W., Singleton, R.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10(4), 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TSP.2010.2082536","volume":"59","author":"MA Khajehnejad","year":"2010","unstructured":"Khajehnejad, M.A., Dimakis, A.G., Xu, W., Hassibi, B.: Sparse recovery of nonnegative signals with minimal expansion. IEEE Trans. Sig. Process. 59(1), 196\u2013208 (2010)","journal-title":"IEEE Trans. Sig. Process."},{"issue":"2","key":"8_CR25","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1109\/TIT.2017.2746620","volume":"64","author":"R Kueng","year":"2017","unstructured":"Kueng, R., Jung, P.: Robust nonnegative sparse recovery and the nullspace property of 0\/1 measurements. IEEE Trans. Inf. Theory 64(2), 689\u2013703 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MSP.2007.914728","volume":"25","author":"M Lustig","year":"2008","unstructured":"Lustig, M., Donoho, D.L., Santos, J.M., Pauly, J.M.: Compressed sensing MRI. IEEE Sig. Process. Mag. 25(2), 72\u201382 (2008)","journal-title":"IEEE Sig. Process. Mag."},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Malioutov, D., Malyutov, M.: Boolean compressed sensing: LP relaxation for group testing. In: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3305\u20133308. IEEE (2012)","DOI":"10.1109\/ICASSP.2012.6288622"},{"key":"8_CR28","first-page":"171","volume":"55","author":"HQ Ngo","year":"2000","unstructured":"Ngo, H.Q., Du, D.Z.: A survey on combinatorial group testing algorithms with applications to DNA library screening. Discrete Math. Probl. Med. Appl. 55, 171\u2013182 (2000)","journal-title":"Discrete Math. Probl. Med. Appl."},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Perchetti, G.A., et al.: Pooling of SARS-CoV-2 samples to increase molecular testing throughput. J. Clin. Virol. 104570 (2020)","DOI":"10.1016\/j.jcv.2020.104570"},{"issue":"6","key":"8_CR30","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1093\/infdis\/jiaa378","volume":"222","author":"CD Pilcher","year":"2020","unstructured":"Pilcher, C.D., Westreich, D., Hudgens, M.G.: Group testing for severe acute respiratory syndrome-coronavirus 2 to enable rapid scale-up of testing and real-time surveillance of incidence. J. Infect. Dis. 222(6), 903\u2013909 (2020)","journal-title":"J. Infect. Dis."},{"issue":"12","key":"8_CR31","doi-asserted-by":"publisher","first-page":"7982","DOI":"10.1109\/TIT.2011.2163296","volume":"57","author":"E Porat","year":"2011","unstructured":"Porat, E., Rothschild, A.: Explicit nonadaptive combinatorial group testing schemes. IEEE Trans. Inf. Theory 57(12), 7982\u20137989 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"8_CR32","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Shental, N., et al.: Efficient high-throughput SARS-CoV-2 testing to detect asymptomatic carriers. Sci. Adv. eabc5961 (2020)","DOI":"10.1101\/2020.04.14.20064618"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"T\u00e4ufer, M.: Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing. J. Theor. Biol. 506, 110450 (2020)","DOI":"10.1016\/j.jtbi.2020.110450"},{"key":"8_CR35","unstructured":"4ti2 team: 4ti2\u2013a software package for algebraic, geometric and combinatorial problems on linear spaces (2020). https:\/\/4ti2.github.io"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Walensky, R.P., Del Rio, C.: From mitigation to containment of the COVID-19 pandemic: Putting the SARS-CoV-2 genie back in the bottle. JAMA-J. Am. Med. Assoc. 323, 1889\u20131890 (2020)","DOI":"10.1001\/jama.2020.6572"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Wang, C., Zhao, Q., Chuah, C.N.: Optimal nested test plan for combinatorial quantitative group testing. IEEE Trans. Sig. Process. 66(4), 992\u20131006 (2017)","DOI":"10.1109\/TSP.2017.2780053"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04749-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,11]],"date-time":"2022-05-11T23:04:22Z","timestamp":1652310262000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04749-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031047480","9783031047497"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04749-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Diego, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb2022.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"188","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}