{"id":"https://openalex.org/W2053547515","doi":"https://doi.org/10.1142/s1793830911001383","title":"BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES","display_name":"BOUNDS FOR NONADAPTIVE GROUP TESTS TO ESTIMATE THE AMOUNT OF DEFECTIVES","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2053547515","doi":"https://doi.org/10.1142/s1793830911001383","mag":"2053547515"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830911001383","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830911001383","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056718928","display_name":"Peter Damaschke","orcid":"https://orcid.org/0000-0003-4047-7594"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"PETER DAMASCHKE","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University, 41296 G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University, 41296 G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026153657","display_name":"Azam Sheikh Muhammad","orcid":"https://orcid.org/0000-0001-6037-7019"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"AZAM SHEIKH MUHAMMAD","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University, 41296 G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University, 41296 G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056718928"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":0.308,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57765002,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"03","issue":"04","first_page":"517","last_page":"536"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11754","display_name":"SARS-CoV-2 detection and testing","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T11754","display_name":"SARS-CoV-2 detection and testing","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2725","display_name":"Infectious Diseases"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9749000072479248,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7242056131362915},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7195722460746765},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7056745290756226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6839845776557922},{"id":"https://openalex.org/keywords/group-testing","display_name":"Group testing","score":0.6470144987106323},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6430591940879822},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5472041368484497},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.546669602394104},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5330079197883606},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5264005661010742},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5039884448051453},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4390360116958618},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3900022506713867},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.3306727409362793},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2287159264087677}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7242056131362915},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7195722460746765},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7056745290756226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6839845776557922},{"id":"https://openalex.org/C177580056","wikidata":"https://www.wikidata.org/wiki/Q5611272","display_name":"Group testing","level":2,"score":0.6470144987106323},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6430591940879822},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5472041368484497},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.546669602394104},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5330079197883606},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5264005661010742},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5039884448051453},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4390360116958618},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3900022506713867},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.3306727409362793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2287159264087677},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s1793830911001383","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830911001383","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:research.chalmers.se:513145","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/6943f859-3414-48ac-90c7-80bf0ece9248","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W600184216","https://openalex.org/W1971371277","https://openalex.org/W1975680434","https://openalex.org/W1982865907","https://openalex.org/W2011318632","https://openalex.org/W2040374776","https://openalex.org/W2042090350","https://openalex.org/W2054082149","https://openalex.org/W2104350151","https://openalex.org/W2137509088","https://openalex.org/W2167973519","https://openalex.org/W2171327317","https://openalex.org/W3097993501","https://openalex.org/W3106239323"],"related_works":["https://openalex.org/W2011106535","https://openalex.org/W1541068124","https://openalex.org/W1994598067","https://openalex.org/W2036758175","https://openalex.org/W2007715402","https://openalex.org/W1525123833","https://openalex.org/W2475816962","https://openalex.org/W2004524662","https://openalex.org/W2962985337","https://openalex.org/W2899261484"],"abstract_inverted_index":{"Group":[0],"testing":[1],"is":[2,73,101,109,122,191],"the":[3,38,157,169,174,198,206,211],"problem":[4,121],"of":[5,12,34,51,106,114,140,168,171,213,234],"finding":[6],"d":[7,42,72,115],"defectives":[8],"in":[9,55,60,62,76,88,125,197],"a":[10,31,47,97,117,141,185,237],"set":[11],"n":[13],"elements,":[14],"by":[15],"asking":[16],"carefully":[17],"chosen":[18,160],"subsets":[19],"(pools)":[20],"whether":[21],"they":[22,227],"contain":[23],"defectives.":[24],"Strategies":[25],"are":[26,58,94,151,159,228],"preferred":[27],"that":[28,146,226],"use":[29],"both":[30],"small":[32,48],"number":[33,50],"tests":[35,54,93,139,150,172],"close":[36,230],"to":[37,64,110,177,192,219,231],"information-theoretic":[39],"lower":[40],"bound":[41,222],"log":[43,85,135,148,200],"2":[44],"n,":[45],"and":[46,96,210,224],"constant":[49,98,118,186,195],"stages,":[52,90],"where":[53],"every":[56],"stage":[57],"done":[59],"parallel,":[61],"order":[63],"save":[65],"time.":[66],"They":[67],"should":[68],"even":[69],"work":[70],"if":[71,91,154],"not":[74],"known":[75],"advance.":[77],"In":[78],"fact,":[79],"one":[80],"can":[81,130],"succeed":[82],"with":[83,133,184],"O(d":[84],"n)":[86,136,149,201],"queries":[87],"two":[89,181],"certain":[92,142],"randomized":[95,137],"failure":[99],"probability":[100,209],"allowed.":[102],"An":[103],"essential":[104],"ingredient":[105],"such":[107],"strategies":[108],"get":[111,193],"an":[112,166],"estimate":[113],"within":[116],"factor.":[119],"This":[120],"also":[123,152],"interesting":[124],"its":[126],"own":[127],"right.":[128],"It":[129],"be":[131],"solved":[132],"O(":[134,199],"group":[138],"type.":[143],"We":[144,215],"prove":[145],"\u03a9(":[147],"necessary,":[153],"elements":[155],"for":[156],"pools":[158],"independently.":[161],"The":[162,188],"proof":[163],"builds":[164],"upon":[165],"analysis":[167],"influence":[170],"on":[173,205],"searcher's":[175],"ability":[176],"distinguish":[178],"between":[179],"any":[180],"candidate":[182],"numbers":[183],"ratio.":[187],"next":[189],"challenge":[190],"optimal":[194],"factors":[196],"test":[202],"number,":[203],"depending":[204],"prescribed":[207],"error":[208],"accuracy":[212],"d.":[214],"give":[216],"practical":[217],"methods":[218],"derive":[220],"upper":[221],"tradeoffs":[223],"conjecture":[225],"already":[229],"optimal.":[232],"One":[233],"them":[235],"uses":[236],"linear":[238],"programming":[239],"formulation.":[240]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}