{"id":"https://openalex.org/W4289655381","doi":"https://doi.org/10.1109/isit50566.2022.9834531","title":"A New Algebraic Approach for String Reconstruction from Substring Compositions","display_name":"A New Algebraic Approach for String Reconstruction from Substring Compositions","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655381","doi":"https://doi.org/10.1109/isit50566.2022.9834531"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834531","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101766703","display_name":"Utkarsh Gupta","orcid":"https://orcid.org/0000-0002-3556-9884"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Utkarsh Gupta","raw_affiliation_strings":["University of Michigan,Department of Electrical Engineering and Computer Science,Ann Arbor,USA,MI 48109"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan,Department of Electrical Engineering and Computer Science,Ann Arbor,USA,MI 48109","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["University of Michigan,Department of Electrical Engineering and Computer Science,Ann Arbor,USA,MI 48109"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan,Department of Electrical Engineering and Computer Science,Ann Arbor,USA,MI 48109","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":6.2197,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.96248295,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"354","last_page":"359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998999834060669,"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.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9976999759674072,"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.9907000064849854,"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/substring","display_name":"Substring","score":0.8832628726959229},{"id":"https://openalex.org/keywords/multiset","display_name":"Multiset","score":0.8037559986114502},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6538732051849365},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.540876030921936},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5275986790657043},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47775569558143616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4620378017425537},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4376087486743927},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43577349185943604},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43186214566230774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3575940430164337},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3462379574775696},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.22180217504501343}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8832628726959229},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.8037559986114502},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6538732051849365},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.540876030921936},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5275986790657043},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47775569558143616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4620378017425537},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4376087486743927},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43577349185943604},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43186214566230774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3575940430164337},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3462379574775696},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.22180217504501343},{"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834531","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1946587648","https://openalex.org/W2088310213","https://openalex.org/W2112822946","https://openalex.org/W2114487425","https://openalex.org/W2162980030","https://openalex.org/W2302781903","https://openalex.org/W2336019055","https://openalex.org/W2762217897","https://openalex.org/W2899496408","https://openalex.org/W2963412269","https://openalex.org/W2964194865","https://openalex.org/W2975272736","https://openalex.org/W3006320382","https://openalex.org/W3028579427","https://openalex.org/W3081324042","https://openalex.org/W3135906068","https://openalex.org/W3172394053","https://openalex.org/W3173530340","https://openalex.org/W3177025870","https://openalex.org/W4205666823","https://openalex.org/W4247131114","https://openalex.org/W4289655381","https://openalex.org/W6640626097"],"related_works":["https://openalex.org/W2051304374","https://openalex.org/W4286787697","https://openalex.org/W1505605100","https://openalex.org/W3043769852","https://openalex.org/W3210979406","https://openalex.org/W4308670360","https://openalex.org/W2950721324","https://openalex.org/W4200187525","https://openalex.org/W4230921427","https://openalex.org/W1970688438"],"abstract_inverted_index":{"We":[0,31,62],"consider":[1],"the":[2,9,19,37,50,54,60,69,77,85,89,98,115,131,134,151,156,177],"problem":[3,38],"of":[4,11,39,53,59,100,109,126,133,144,163],"binary":[5,70,135,145],"string":[6,40,71],"reconstruction":[7,41,164,189],"from":[8,42],"multiset":[10,46],"its":[12,43],"substring":[13,20,44],"compositions,":[14],"i.e.,":[15],"referred":[16],"to":[17,72,114,161,176],"as":[18],"composition":[21,45],"multiset,":[22],"first":[23],"introduced":[24],"and":[25,154],"studied":[26],"by":[27,117,150,169,181],"Acharya":[28,118],"et":[29,119,183],"al.":[30],"introduce":[32],"a":[33,106,123,170],"new":[34,152],"algorithm":[35,78,104,116,153],"for":[36,68,158],"which":[47,121],"relies":[48],"on":[49],"algebraic":[51,66],"properties":[52],"equivalent":[55],"bivariate":[56],"polynomial":[57],"formulation":[58],"problem.":[61],"then":[63],"characterize":[64],"specific":[65],"conditions":[67],"be":[73],"reconstructed":[74],"that":[75,141,166],"guarantee":[76],"does":[79],"not":[80],"require":[81],"any":[82],"backtracking":[83,159],"through":[84],"reconstruction,":[86],"and,":[87],"consequently,":[88],"time":[90,107,124],"complexity":[91,108,125],"is":[92,130,139],"bounded":[93],"polynomially.":[94],"More":[95],"specifically,":[96],"in":[97,111,173],"case":[99],"no":[101],"backtracking,":[102],"our":[103],"has":[105,122],"O(n2)":[110,187],"practice,":[112],"compared":[113,175],"al.,":[120,184],"O(n2logn),":[127],"where":[128],"n":[129],"length":[132],"string.":[136],"Furthermore,":[137],"it":[138],"shown":[140],"larger":[142],"sets":[143],"strings":[146],"are":[147,167],"uniquely":[148],"reconstructable":[149],"without":[155],"need":[157],"leading":[160],"codebooks":[162],"codes":[165],"larger,":[168],"linear":[171],"factor":[172],"size,":[174],"previously":[178],"known":[179],"construction":[180],"Pattabiraman":[182],"while":[185],"having":[186],"practical":[188],"complexity.":[190]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}