{"id":"https://openalex.org/W1941245335","doi":"https://doi.org/10.1109/tit.2015.2466635","title":"Low-Complexity Interactive Algorithms for Synchronization From Deletions, Insertions, and Substitutions","display_name":"Low-Complexity Interactive Algorithms for Synchronization From Deletions, Insertions, and Substitutions","publication_year":2015,"publication_date":"2015-08-13","ids":{"openalex":"https://openalex.org/W1941245335","doi":"https://doi.org/10.1109/tit.2015.2466635","mag":"1941245335"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2015.2466635","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2466635","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1310.2026","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ramji Venkataramanan","orcid":null},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ramji Venkataramanan","raw_affiliation_strings":["Department of Engineering, University of Cambridge, Cambridge, U.K"],"affiliations":[{"raw_affiliation_string":"Department of Engineering, University of Cambridge, Cambridge, U.K","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Vasuki Narasimha Swamy","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vasuki Narasimha Swamy","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":null,"display_name":"Kannan Ramchandran","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kannan Ramchandran","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":1.6308,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.83151978,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"61","issue":"10","first_page":"5670","last_page":"5689"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9952999949455261,"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.9952999949455261,"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.0017000000225380063,"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/T10885","display_name":"Gene expression and cancer classification","score":0.0003000000142492354,"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.8960999846458435},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5557000041007996},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5347999930381775},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4683000147342682},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4449000060558319},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4072999954223633},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4052000045776367},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.40389999747276306},{"id":"https://openalex.org/keywords/shuffling","display_name":"Shuffling","score":0.39399999380111694}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8960999846458435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6840000152587891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5877000093460083},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5557000041007996},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5347999930381775},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4683000147342682},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4449000060558319},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4228000044822693},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4072999954223633},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4052000045776367},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.40389999747276306},{"id":"https://openalex.org/C167927819","wikidata":"https://www.wikidata.org/wiki/Q1930567","display_name":"Shuffling","level":2,"score":0.39399999380111694},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.38029998540878296},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3506999909877777},{"id":"https://openalex.org/C2778220771","wikidata":"https://www.wikidata.org/wiki/Q1522579","display_name":"Substitution (logic)","level":2,"score":0.34450000524520874},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.3084999918937683},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.30799999833106995},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3075999915599823},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tit.2015.2466635","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2015.2466635","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:www.repository.cam.ac.uk:1810/249100","is_oa":false,"landing_page_url":"https://www.repository.cam.ac.uk/handle/1810/249100","pdf_url":null,"source":{"id":"https://openalex.org/S4306401777","display_name":"Apollo (University of Cambridge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I241749","host_organization_name":"University of Cambridge","host_organization_lineage":["https://openalex.org/I241749"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1310.2026","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1310.2026","pdf_url":"https://arxiv.org/pdf/1310.2026","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1310.2026","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1310.2026","pdf_url":"https://arxiv.org/pdf/1310.2026","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":22,"referenced_works":["https://openalex.org/W1977944850","https://openalex.org/W1981297517","https://openalex.org/W1991876056","https://openalex.org/W2002359896","https://openalex.org/W2008459483","https://openalex.org/W2026739991","https://openalex.org/W2044492449","https://openalex.org/W2052207834","https://openalex.org/W2081354249","https://openalex.org/W2088101210","https://openalex.org/W2088214533","https://openalex.org/W2091950015","https://openalex.org/W2101398931","https://openalex.org/W2109420392","https://openalex.org/W2138256990","https://openalex.org/W2160008123","https://openalex.org/W2162404506","https://openalex.org/W2899702797","https://openalex.org/W6636915900","https://openalex.org/W6645897298","https://openalex.org/W6676293227","https://openalex.org/W6681625143"],"related_works":[],"abstract_inverted_index":{"Consider":[0],"two":[1],"remote":[2],"nodes":[3],"having":[4],"binary":[5],"sequences":[6],"X":[7,40],"and":[8,25,64,106,109,119,166,221,252],"Y,":[9],"respectively.":[10],"Y":[11,37],"is":[12,32,52,83,88,149,181,206],"an":[13,111,153,211],"edited":[14],"version":[15],"of":[16,44,56,61,67,70,81,91,104,123,146,164,189,196,202],"X,":[17],"where":[18,78,86,98,218],"the":[19,34,58,65,76,79,89,96,99,134,159,194,200,214,219,235,268],"editing":[20],"involves":[21],"random":[22],"deletions,":[23],"insertions,":[24],"substitutions,":[26],"possibly":[27],"in":[28,54,175,193,225],"bursts.":[29,228],"The":[30,50,127,191],"goal":[31],"for":[33,267],"node":[35],"with":[36,41,115,185],"to":[38,131,183,213,233,237,248,257],"reconstruct":[39],"minimal":[42],"exchange":[43],"information":[45],"over":[46],"a":[47,102,186,239],"noiseless":[48],"link.":[49],"communication":[51,117],"measured":[53],"terms":[55],"both":[57],"total":[59],"number":[60,66,80,195],"bits":[62],"exchanged":[63],"interactive":[68,112],"rounds":[69,197],"communication.":[71],"This":[72,243],"paper":[73],"focuses":[74],"on":[75,158,171],"setting":[77],"edits":[82,100],"o(n/log":[84],"n),":[85],"n":[87],"length":[90],"X.":[92],"We":[93,168],"first":[94],"consider":[95],"case":[97,217],"are":[101],"mixture":[103],"insertions":[105,220],"deletions":[107,222],"(indels),":[108],"propose":[110],"synchronization":[113,173],"algorithm":[114,128,156,174],"near-optimal":[116],"rate":[118],"average":[120],"computational":[121],"complexity":[122],"O(n)":[124],"arithmetic":[125],"operations.":[126],"uses":[129],"interaction":[130],"efficiently":[132],"split":[133],"source":[135],"sequence":[136],"into":[137],"substrings":[138,148],"containing":[139],"exactly":[140],"one":[141],"deletion":[142],"or":[143],"insertion.":[144],"Each":[145],"these":[147],"then":[150,169],"synchronized":[151],"using":[152],"optimal":[154],"one-way":[155],"based":[157],"single-deletion":[160],"correcting":[161],"channel":[162],"codes":[163],"Varshamov":[165],"Tenengolts.":[167],"build":[170],"this":[172],"three":[176],"different":[177],"ways.":[178],"First,":[179],"it":[180],"modified":[182],"work":[184],"single":[187],"round":[188],"interaction.":[190],"reduction":[192],"comes":[198],"at":[199],"expense":[201],"higher":[203],"communication,":[204],"which":[205],"quantified.":[207],"Next,":[208],"we":[209,230,261],"present":[210],"extension":[212],"practically":[215],"important":[216],"may":[223],"occur":[224],"(potentially":[226],"large)":[227],"Finally,":[229],"show":[231],"how":[232],"synchronize":[234],"sources":[236],"within":[238],"target":[240],"Hamming":[241],"distance.":[242],"feature":[244],"can":[245],"be":[246],"used":[247],"differentiate":[249],"between":[250],"substitution":[251],"indel":[253],"edits.":[254],"In":[255],"addition":[256],"theoretical":[258],"performance":[259],"bounds,":[260],"provide":[262],"several":[263],"validating":[264],"simulation":[265],"results":[266],"proposed":[269],"algorithms.":[270]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2016-06-24T00:00:00"}