{"id":"https://openalex.org/W55864377","doi":null,"title":"The Binary String-to-String Correction Problem","display_name":"The Binary String-to-String Correction Problem","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W55864377","mag":"55864377"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.944.9958","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.944.9958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://dspace.library.uvic.ca/bitstream/handle/1828/4884/Spreen_Thomas_MSc_2013.pdf%3Bjsessionid%3DC0F9ACF78803C966ABED0CCE0BE73951?sequence%3D6","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5090456219","display_name":"Thomas D. Spreen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Thomas D. Spreen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5090456219"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6622,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65536332,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.014600000344216824,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11567","display_name":"semigroups and automata theory","score":0.0031999999191612005,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-alphabet","display_name":"binary alphabet","score":0.800000011920929},{"id":"https://openalex.org/keywords/edit-operations","display_name":"edit operations","score":0.6539999842643738},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9160000085830688},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.824999988079071},{"id":"https://openalex.org/keywords/longest-common-subsequence","display_name":"longest common subsequence","score":0.9829999804496765},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.41100001335144043}],"concepts":[{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6144438982009888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43815991282463074},{"id":"https://openalex.org/C33332235","wikidata":"https://www.wikidata.org/wiki/Q18362","display_name":"Theoretical physics","level":1,"score":0.3797222375869751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34791696071624756},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.32787108421325684}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.944.9958","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.944.9958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://dspace.library.uvic.ca/bitstream/handle/1828/4884/Spreen_Thomas_MSc_2013.pdf%3Bjsessionid%3DC0F9ACF78803C966ABED0CCE0BE73951?sequence%3D6","raw_type":"text"},{"id":"pmh:oai:dspace.library.uvic.ca:1828/4884","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/1828/4884","pdf_url":null,"source":{"id":"https://openalex.org/S4306401509","display_name":"UVic\u2019s Research and Learning Repository (University of Victoria)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I212119943","host_organization_name":"University of Victoria","host_organization_lineage":["https://openalex.org/I212119943"],"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":"Thesis"},{"id":"mag:55864377","doi":null,"is_oa":false,"landing_page_url":"https://dspace.library.uvic.ca/handle/1828/4884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1524298768","https://openalex.org/W1647671624","https://openalex.org/W1970026646","https://openalex.org/W1974708980","https://openalex.org/W1980073965","https://openalex.org/W1989838421","https://openalex.org/W2011039300","https://openalex.org/W2032419831","https://openalex.org/W2039262760","https://openalex.org/W2040176884","https://openalex.org/W2066792529","https://openalex.org/W2077167828","https://openalex.org/W2103985627","https://openalex.org/W2109227373","https://openalex.org/W2149342630","https://openalex.org/W2156036190","https://openalex.org/W2731191334"],"related_works":["https://openalex.org/W1989838421","https://openalex.org/W2736305333","https://openalex.org/W2039262760","https://openalex.org/W2151325537","https://openalex.org/W7099873945","https://openalex.org/W1970026646","https://openalex.org/W2077167828","https://openalex.org/W2021202955","https://openalex.org/W2248630842","https://openalex.org/W2031708572"],"abstract_inverted_index":{"String-to-String":[0,72,81,112,176,258],"Correction":[1,73,82,113,259],"is":[2,90,185,215],"the":[3,38,67,70,80,100,105,135,173,181,190,203,206,212,219,232,243],"process":[4],"of":[5,15,27,49,69,104,120,145,147,163,166,175,183,205,211,221,234,245],"transforming":[6],"some":[7,16,165],"mutable":[8,191],"string":[9,18,21],"M":[10,140],"into":[11],"an":[12,124,142,222],"exact":[13],"copy":[14],"other":[17,251],"(the":[19],"target":[20],"T),":[22],"using":[23,41,55],"a":[24,148,152,235,249],"shortest":[25],"sequence":[26],"well-defined":[28],"edit":[29],"operations.":[30],"The":[31],"formal":[32],"STRING-TO-STRING":[33],"CORRECTION":[34],"problem":[35,83],"asks":[36],"for":[37,92,122],"optimal":[39,125,223],"solution":[40,126],"just":[42],"two":[43,213],"operations:":[44],"symbol":[45,150],"deletion,":[46],"and":[47,58,86,139,159,225,242],"swap":[48,85,198,236],"adjacent":[50],"symbols.":[51],"String":[52],"correction":[53],"problems":[54],"only":[56,89,196],"swaps":[57],"deletions":[59],"are":[60,254],"computationally":[61],"interesting;":[62],"in":[63,130,133,172,189,199],"his":[64],"paper":[65],"On":[66],"Complexity":[68],"Extended":[71],"Problem":[74],"(1975),":[75],"Robert":[76],"Wagner":[77],"proved":[78],"that":[79,180,187,202,226,246,253],"under":[84],"deletion":[87],"operations":[88,184],"NP-complete":[91],"unbounded":[93],"alphabets.":[94],"In":[95],"this":[96],"thesis,":[97],"we":[98,109,157],"present":[99,116],"first":[101],"careful":[102],"examination":[103],"binary-alphabet":[106],"case,":[107],"which":[108,123,167],"call":[110],"Binary":[111,257],"(BSSC).":[114],"We":[115],"several":[117,161],"special":[118],"cases":[119],"BSSC":[121],"can":[127],"be":[128,262],"found":[129],"polynomial":[131],"time;":[132],"particular,":[134],"case":[136,174],"where":[137],"T":[138],"have":[141],"equal":[143],"number":[144],"occurrences":[146],"given":[149],"has":[151],"polynomial-time":[153],"solution.":[154],"As":[155],"well,":[156],"demonstrate":[158],"prove":[160],"properties":[162],"BSSC,":[164],"do":[168],"not":[169],"necessarily":[170],"hold":[171],"Correction.":[177],"For":[178],"instance:":[179],"order":[182],"irrelevant;":[186],"symbols":[188],"string,":[192],"if":[193],"swapped,":[194],"will":[195,260],"ever":[197],"one":[200],"direction;":[201],"length":[204],"Longest":[207],"Common":[208],"Subsequence":[209],"(LCS)":[210],"strings":[214],"monotone":[216],"nondecreasing":[217],"during":[218],"execution":[220],"solution;":[224],"there":[227],"exists":[228],"no":[229],"correlation":[230],"between":[231],"effect":[233],"or":[237],"delete":[238],"operation":[239],"on":[240],"LCS,":[241],"optimality":[244],"operation.":[247],"About":[248],"dozen":[250],"results":[252],"applicable":[255],"to":[256],"also":[261],"presented.":[263]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}