{"id":"https://openalex.org/W2612949592","doi":"https://doi.org/10.1109/isit.2017.8007097","title":"On the optimality of some group testing algorithms","display_name":"On the optimality of some group testing algorithms","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2612949592","doi":"https://doi.org/10.1109/isit.2017.8007097","mag":"2612949592"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8007097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1705.02708","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Matthew Aldridge","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166532","display_name":"Heilbronn Institute for Mathematical Research","ror":"https://ror.org/05ttdgs63","country_code":"GB","type":"facility","lineage":["https://openalex.org/I4210166532"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Matthew Aldridge","raw_affiliation_strings":["Department of Mathematical Sciences, Heilbronn Institute for Mathematical Research Bristol, Bath, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Heilbronn Institute for Mathematical Research Bristol, Bath, U.K","institution_ids":["https://openalex.org/I4210166532"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210166532"],"apc_list":null,"apc_paid":null,"fwci":0.9501,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.72749263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3085","last_page":"3089"},"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.9998000264167786,"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.9998000264167786,"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/T11393","display_name":"Biosensors and Analytical Detection","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9842000007629395,"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/bernoullis-principle","display_name":"Bernoulli's principle","score":0.5454999804496765},{"id":"https://openalex.org/keywords/group-testing","display_name":"Group testing","score":0.5306000113487244},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5091999769210815},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.48649999499320984},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4620000123977661},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4142000079154968}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6624000072479248},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.593500018119812},{"id":"https://openalex.org/C152361515","wikidata":"https://www.wikidata.org/wiki/Q181328","display_name":"Bernoulli's principle","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C177580056","wikidata":"https://www.wikidata.org/wiki/Q5611272","display_name":"Group testing","level":2,"score":0.5306000113487244},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5091999769210815},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.48649999499320984},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4620000123977661},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4142000079154968},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36899998784065247},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3546000123023987},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2948000133037567},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2782000005245209},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.26460000872612},{"id":"https://openalex.org/C87007009","wikidata":"https://www.wikidata.org/wiki/Q210832","display_name":"Statistical hypothesis testing","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2017.8007097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1705.02708","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1705.02708","pdf_url":"https://arxiv.org/pdf/1705.02708","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:purehost.bath.ac.uk:openaire/b15ed6bf-5cd7-40b7-a2fe-ff52815e8b3a","is_oa":true,"landing_page_url":"https://researchportal.bath.ac.uk/en/publications/b15ed6bf-5cd7-40b7-a2fe-ff52815e8b3a","pdf_url":null,"source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aldridge, M 2017, On the optimality of some group testing algorithms. in Proceedings of 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, pp. 3085-3089, 2017 IEEE International Symposium on Information Theory (ISIT), 25/06/17. https://doi.org/10.1109/ISIT.2017.8007097","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1705.02708","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1705.02708","pdf_url":"https://arxiv.org/pdf/1705.02708","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1537002715","https://openalex.org/W1996446882","https://openalex.org/W2017825268","https://openalex.org/W2067389921","https://openalex.org/W2068033507","https://openalex.org/W2098902711","https://openalex.org/W2158419847","https://openalex.org/W2159716457","https://openalex.org/W2173497155","https://openalex.org/W2510244936"],"related_works":[],"abstract_inverted_index":{"We":[0,35,56],"consider":[1],"Bernoulli":[2],"nonadaptive":[3],"group":[4],"testing":[5],"with":[6],"k":[7],"=":[8],"\u0398(\u03b7":[9],"<sup":[10],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[11],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u03b8</sup>":[12],")":[13],"defectives,":[14],"for":[15,31,52,84],"\u03b8":[16,32,53,85],"\u03f5":[17],"(0,1).":[18],"The":[19],"practical":[20],"definite":[21],"defectives":[22],"(DD)":[23],"detection":[24],"algorithm":[25,62],"is":[26,49],"known":[27],"to":[28],"be":[29],"optimal":[30,83],">":[33],"1/2.":[34,87],"give":[36],"a":[37,70],"new":[38],"upper":[39],"bound":[40],"on":[41,66],"the":[42,60],"rate":[43,71],"of":[44],"DD,":[45,77],"showing":[46],"that":[47,59],"DD":[48],"strictly":[50],"suboptimal":[51],"<;":[54],"0.41.":[55],"also":[57,82],"show":[58],"SCOMP":[61],"and":[63],"algorithms":[64],"based":[65],"linear":[67],"programming":[68],"achieve":[69],"at":[72],"least":[73],"as":[74,76],"high":[75],"so":[78],"in":[79],"particular":[80],"are":[81],"\u2265":[86]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2017-05-19T00:00:00"}