{"id":"https://openalex.org/W4415368361","doi":"https://doi.org/10.1109/tit.2025.3623202","title":"A Combinatorial Perspective on Random Access Efficiency for DNA Storage","display_name":"A Combinatorial Perspective on Random Access Efficiency for DNA Storage","publication_year":2025,"publication_date":"2025-10-20","ids":{"openalex":"https://openalex.org/W4415368361","doi":"https://doi.org/10.1109/tit.2025.3623202"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2025.3623202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3623202","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","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/A5075442918","display_name":"Anina Gruica","orcid":"https://orcid.org/0009-0008-3066-3223"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Anina Gruica","raw_affiliation_strings":["Department of Applied Mathematics and Computer Science, Technical University of Denmark, Lyngby, Denmark","Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kongens Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]},{"raw_affiliation_string":"Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070410810","display_name":"Daniella Bar-Lev","orcid":"https://orcid.org/0000-0001-6766-1450"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniella Bar-Lev","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Center for Memory and Recording Research, University of California at San Diego, La Jolla, CA, USA","Department of Electrical and Computer Engineering, Center for Memory and Recording Research, University of California, 9500 Gilman Drive, San Diego, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Center for Memory and Recording Research, University of California at San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Center for Memory and Recording Research, University of California, 9500 Gilman Drive, San Diego, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025356502","display_name":"Alberto Ravagnani","orcid":"https://orcid.org/0000-0001-5901-9484"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alberto Ravagnani","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021586372","display_name":"Eitan Yaakobi","orcid":"https://orcid.org/0000-0002-9851-5234"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eitan Yaakobi","raw_affiliation_strings":["Henry and Marilyn Taub Faculty of Computer Science, Technion&#x2014;Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Henry and Marilyn Taub Faculty of Computer Science, Technion&#x2014;Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075442918"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25841042,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"71","issue":"12","first_page":"9395","last_page":"9412"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9815999865531921,"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"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9815999865531921,"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"}},{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9114999771118164,"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/generator-matrix","display_name":"Generator matrix","score":0.6852999925613403},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.646399974822998},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.6401000022888184},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.6319000124931335},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4846999943256378},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.45100000500679016},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.435699999332428},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4318999946117401},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.40619999170303345}],"concepts":[{"id":"https://openalex.org/C1842014","wikidata":"https://www.wikidata.org/wiki/Q1502046","display_name":"Generator matrix","level":3,"score":0.6852999925613403},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.646399974822998},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.6401000022888184},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.6319000124931335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.588100016117096},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4846999943256378},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4672999978065491},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.45100000500679016},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.435699999332428},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4318999946117401},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4156000018119812},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.40619999170303345},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4025000035762787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36890000104904175},{"id":"https://openalex.org/C201866948","wikidata":"https://www.wikidata.org/wiki/Q228206","display_name":"Random number generation","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.3483000099658966},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.2906000018119812},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C3020028006","wikidata":"https://www.wikidata.org/wiki/Q9158","display_name":"Electronic mail","level":2,"score":0.2727000117301941},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C64812099","wikidata":"https://www.wikidata.org/wiki/Q176604","display_name":"Random matrix","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C32795469","wikidata":"https://www.wikidata.org/wiki/Q5156430","display_name":"Complementary sequences","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2025.3623202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3623202","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/f7be2e32-0e4d-4914-911b-f0165da85270","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/f7be2e32-0e4d-4914-911b-f0165da85270","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gruica, A, Bar-Lev, D, Ravagnani, A & Yaakobi, E 2025, 'A Combinatorial Perspective on Random Access Efficiency for DNA Storage', IEEE Transactions on Information Theory, vol. 71, no. 12, pp. 9395-9412. https://doi.org/10.1109/TIT.2025.3623202","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2054292630","display_name":null,"funder_award_id":"VIL?52303?","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G2419008608","display_name":null,"funder_award_id":"VIL52303","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"},{"id":"https://openalex.org/G4513519393","display_name":null,"funder_award_id":"OCENW.KLEIN.539","funder_id":"https://openalex.org/F4320322887","funder_display_name":"The Research Council"},{"id":"https://openalex.org/G5021082111","display_name":null,"funder_award_id":"CCF2212437","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5618363122","display_name":null,"funder_award_id":"VI.Vidi.203.045","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G660757063","display_name":null,"funder_award_id":"OCENW.KLEIN.539","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G731172527","display_name":null,"funder_award_id":"101045114","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320322887","display_name":"The Research Council","ror":"https://ror.org/03tcppy59"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1946587648","https://openalex.org/W1997044393","https://openalex.org/W2005830269","https://openalex.org/W2318076643","https://openalex.org/W2333320475","https://openalex.org/W2471091339","https://openalex.org/W2592122940","https://openalex.org/W2788257106","https://openalex.org/W2918466505","https://openalex.org/W2951269465","https://openalex.org/W2962809499","https://openalex.org/W2963561675","https://openalex.org/W2972936807","https://openalex.org/W2993276217","https://openalex.org/W4213456065","https://openalex.org/W4386075244","https://openalex.org/W4393497334","https://openalex.org/W4399207509","https://openalex.org/W4401692191","https://openalex.org/W4401693833"],"related_works":[],"abstract_inverted_index":{"We":[0,183,228],"investigate":[1,161],"the":[2,6,27,53,56,77,85,102,109,118,127,135,162,174,206,216,231,282,293,316],"fundamental":[3],"limits":[4],"of":[5,31,72,88,123,177,211,233,268,284,310,315],"recently":[7],"proposed":[8],"<italic":[9,32,41,49,112,124,146,190,212,234,258,297],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[10,33,42,50,113,125,147,149,151,191,193,195,213,235,259,261,263,298,300,302],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">random":[11],"access":[12,79,164],"coverage":[13,80,165],"depth":[14,81,166],"problem</i>":[15],"for":[16,120,197,244,265,296],"DNA":[17],"data":[18],"storage.":[19],"Under":[20],"this":[21,75,154],"paradigm,":[22],"it":[23],"is":[24,66,129],"assumed":[25],"that":[26,133,180,292],"user":[28],"information":[29,35,98,142,317],"consists":[30],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">k</i>":[34],"strands,":[36,143],"which":[37],"are":[38,58,181,304],"encoded":[39,311],"into":[40,220],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</i>":[43],"strands":[44,57,312],"via":[45],"a":[46,69,96,245,307],"generator":[47,110,178,199],"matrix":[48,111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">G</i>.":[51],"During":[52],"sequencing":[54],"process,":[55],"read":[59],"uniformly":[60],"at":[61],"random,":[62],"as":[63,271],"each":[64],"strand":[65,99],"available":[67],"in":[68],"large":[70],"number":[71,87],"copies.":[73],"In":[74,153],"context,":[76],"random":[78,163],"problem":[82,105],"refers":[83],"to":[84,94,130,160,188,247,256],"expected":[86],"reads":[89],"(i.e.,":[90],"sequenced":[91],"strands)":[92],"required":[93],"decode":[95],"specific":[97,308],"requested":[100,141],"by":[101,145],"user.":[103],"This":[104],"heavily":[106],"depends":[107,204],"on":[108,205],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">G</i>,":[114,126,214],"and":[115,172,224,239,275,288,313],"besides":[116],"computing":[117],"expectation":[119,137],"different":[121],"choices":[122],"goal":[128],"construct":[131],"matrices":[132,179],"minimize":[134],"maximum":[136],"over":[138],"all":[139],"possible":[140],"denoted":[144],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">T</i><sub":[148,192,260,299],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>(<italic":[150,194,262,301],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">G</i>).":[152],"paper,":[155],"we":[156,280],"introduce":[157,230],"new":[158],"techniques":[159],"problem,":[167],"capturing":[168],"its":[169],"combinatorial":[170],"nature":[171],"identifying":[173],"structural":[175],"properties":[176],"advantageous.":[182],"establish":[184],"two":[185],"general":[186],"formulas":[187],"determine":[189],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">G</i>)":[196,264,303],"arbitrary":[198],"matrices.":[200],"The":[201],"first":[202],"formula":[203,218],"linear":[207],"dependencies":[208],"between":[209],"columns":[210],"whereas":[215],"second":[217],"takes":[219],"account":[221],"recovery":[222,249],"sets":[223],"their":[225],"intersection":[226],"structure.":[227],"also":[229],"concept":[232],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">recovery":[236],"balanced":[237],"codes</i>":[238],"provide":[240],"three":[241],"sufficient":[242],"conditions":[243,252],"code":[246],"be":[248,254],"balanced.":[250],"These":[251],"can":[253],"used":[255],"compute":[257],"various":[266],"families":[267],"codes,":[269],"such":[270],"MDS,":[272],"simplex,":[273],"Hamming,":[274],"binary":[276],"Reed-Muller":[277],"codes.":[278],"Additionally,":[279],"study":[281],"performance":[283],"modified":[285],"systematic":[286],"MDS":[287],"simplex":[289],"matrices,":[290],"showing":[291],"best":[294],"results":[295],"achieved":[305],"with":[306],"combination":[309],"replication":[314],"strands.":[318]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}