{"id":"https://openalex.org/W1988010239","doi":"https://doi.org/10.3390/a4010040","title":"Edit Distance with Block Deletions","display_name":"Edit Distance with Block Deletions","publication_year":2011,"publication_date":"2011-03-07","ids":{"openalex":"https://openalex.org/W1988010239","doi":"https://doi.org/10.3390/a4010040","mag":"1988010239"},"language":"en","primary_location":{"id":"doi:10.3390/a4010040","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a4010040","pdf_url":"https://www.mdpi.com/1999-4893/4/1/40/pdf?version=1299506491","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/4/1/40/pdf?version=1299506491","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042328423","display_name":"Dana Shapira","orcid":"https://orcid.org/0000-0002-2320-9064"},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]},{"id":"https://openalex.org/I154488051","display_name":"Ashkelon Academic College","ror":"https://ror.org/00sfwx025","country_code":"IL","type":"education","lineage":["https://openalex.org/I154488051"]}],"countries":["IL","US"],"is_corresponding":true,"raw_author_name":"Dana Shapira","raw_affiliation_strings":["Ashkelon Academic College, 12 Ben-Tzvi Street, Ashkelon 78211, Israel","Brandeis University"],"affiliations":[{"raw_affiliation_string":"Ashkelon Academic College, 12 Ben-Tzvi Street, Ashkelon 78211, Israel","institution_ids":["https://openalex.org/I154488051"]},{"raw_affiliation_string":"Brandeis University","institution_ids":["https://openalex.org/I6902469"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036953367","display_name":"James A. Storer","orcid":null},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James A. Storer","raw_affiliation_strings":["Brandeis University, 415 South Street, Waltham, MA 02453, USA"],"affiliations":[{"raw_affiliation_string":"Brandeis University, 415 South Street, Waltham, MA 02453, USA","institution_ids":["https://openalex.org/I6902469"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042328423"],"corresponding_institution_ids":["https://openalex.org/I154488051","https://openalex.org/I6902469"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.4276,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70848298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"4","issue":"1","first_page":"40","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9965999722480774,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/edit-distance","display_name":"Edit distance","score":0.8088189363479614},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.7850888967514038},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7054819464683533},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6409159302711487},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5900206565856934},{"id":"https://openalex.org/keywords/character","display_name":"Character (mathematics)","score":0.48831960558891296},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44012048840522766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4373200535774231},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43621742725372314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4266248345375061},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3836933970451355},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3389894366264343}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.8088189363479614},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.7850888967514038},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7054819464683533},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6409159302711487},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5900206565856934},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.48831960558891296},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44012048840522766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4373200535774231},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43621742725372314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4266248345375061},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3836933970451355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3389894366264343},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a4010040","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a4010040","pdf_url":"https://www.mdpi.com/1999-4893/4/1/40/pdf?version=1299506491","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:8b05b7f480c242fdae2dfe11049eb35e","is_oa":true,"landing_page_url":"https://doaj.org/article/8b05b7f480c242fdae2dfe11049eb35e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 4, Iss 1, Pp 40-60 (2011)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/4/1/40/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a4010040","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 4; Issue 1; Pages: 40-60","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a4010040","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a4010040","pdf_url":"https://www.mdpi.com/1999-4893/4/1/40/pdf?version=1299506491","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4099999964237213,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1988010239.pdf","grobid_xml":"https://content.openalex.org/works/W1988010239.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1504417041","https://openalex.org/W1544314838","https://openalex.org/W1589530536","https://openalex.org/W1597445688","https://openalex.org/W1644420677","https://openalex.org/W1977957904","https://openalex.org/W1982055477","https://openalex.org/W2002423246","https://openalex.org/W2008803097","https://openalex.org/W2011632873","https://openalex.org/W2012010763","https://openalex.org/W2019738397","https://openalex.org/W2022715218","https://openalex.org/W2023749136","https://openalex.org/W2030016852","https://openalex.org/W2046042060","https://openalex.org/W2068426944","https://openalex.org/W2087064593","https://openalex.org/W2088179629","https://openalex.org/W2146101030","https://openalex.org/W2151325537","https://openalex.org/W2523785889","https://openalex.org/W4248804345","https://openalex.org/W4285719527","https://openalex.org/W6636112348","https://openalex.org/W6656391896"],"related_works":["https://openalex.org/W2059442203","https://openalex.org/W2002423246","https://openalex.org/W2595899102","https://openalex.org/W2421475109","https://openalex.org/W4297792110","https://openalex.org/W1629505938","https://openalex.org/W2963209704","https://openalex.org/W1504650505","https://openalex.org/W1676587966","https://openalex.org/W2950592963"],"abstract_inverted_index":{"Several":[0],"variants":[1],"of":[2,88],"the":[3,19,38,86],"edit":[4,20,39],"distance":[5,21,40],"problem":[6,60,70,87],"with":[7,22,41],"block":[8,23,33,42,45,90,93],"deletions":[9,24,46,94],"are":[10,16],"considered.":[11],"Polynomial":[12,50],"time":[13,51],"optimal":[14],"algorithms":[15],"presented":[17],"for":[18],"allowing":[25],"character":[26,29],"insertions":[27],"and":[28,44,67,79,92],"moves,":[30],"but":[31],"without":[32],"moves.":[34],"We":[35],"show":[36],"that":[37,80],"moves":[43,91],"is":[47],"NP-complete":[48],"(Nondeterministic":[49],"problems":[52],"in":[53,64,76],"which":[54],"any":[55,68],"given":[56],"solution":[57],"to":[58,85],"such":[59],"can":[61,71,82],"be":[62,72,83],"verified":[63],"polynomial":[65,77],"time,":[66],"NP":[69],"converted":[73],"into":[74],"it":[75,81],"time),":[78],"reduced":[84],"non-recursive":[89],"within":[95],"a":[96],"constant":[97],"factor.":[98]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}