{"id":"https://openalex.org/W2012746331","doi":"https://doi.org/10.1186/1748-7188-8-27","title":"Efficient edit distance with duplications and contractions","display_name":"Efficient edit distance with duplications and contractions","publication_year":2013,"publication_date":"2013-10-29","ids":{"openalex":"https://openalex.org/W2012746331","doi":"https://doi.org/10.1186/1748-7188-8-27","mag":"2012746331","pmid":"https://pubmed.ncbi.nlm.nih.gov/24168705"},"language":"en","primary_location":{"id":"doi:10.1186/1748-7188-8-27","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-8-27","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-8-27","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-8-27","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087375181","display_name":"Tamar Pinhas","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Tamar Pinhas","raw_affiliation_strings":["Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel","Department of Computer Science, Ben-Gurion University of the Negev, Be'er-Sheva, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Be'er-Sheva, Israel#TAB#","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086253860","display_name":"Shay Zakov","orcid":null},"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":"Shay Zakov","raw_affiliation_strings":["Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA, USA","Dept. of Comput. Sci. & Eng., Univ. of California at San Diego, La Jolla, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Univ. of California at San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074156188","display_name":"Dekel Tsur","orcid":"https://orcid.org/0000-0001-9763-3784"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Dekel Tsur","raw_affiliation_strings":["Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel","Department of Computer Science, Ben-Gurion University of the Negev, Be'er-Sheva, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Be'er-Sheva, Israel#TAB#","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048383219","display_name":"Michal Ziv-Ukelson","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michal Ziv-Ukelson","raw_affiliation_strings":["Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel","Department of Computer Science, Ben-Gurion University of the Negev, Be'er-Sheva, Israel#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Be'er Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Be'er-Sheva, Israel#TAB#","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5087375181"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":1490,"currency":"GBP","value_usd":1827},"apc_paid":{"value":1490,"currency":"GBP","value_usd":1827},"fwci":1.9765,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.88248142,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"8","issue":"1","first_page":"27","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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.9995999932289124,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9724000096321106,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9689000248908997,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.6963886022567749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6581823825836182},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3381810784339905},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2490755319595337}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.6963886022567749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6581823825836182},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3381810784339905},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2490755319595337}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1186/1748-7188-8-27","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-8-27","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-8-27","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},{"id":"pmid:24168705","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/24168705","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for molecular biology : AMB","raw_type":null},{"id":"pmh:oai:escholarship.org/ark:/13030/qt6pj223f2","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/6pj223f2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms for Molecular Biology, vol 8, iss 1","raw_type":"article"},{"id":"pmh:oai:europepmc.org:2872921","is_oa":true,"landing_page_url":"http://europepmc.org/articles/PMC3879238","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"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":"","raw_type":"Text"},{"id":"pmh:oai:pubmedcentral.nih.gov:3879238","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/3879238","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"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 Mol Biol","raw_type":"Text"},{"id":"pmh:qt6pj223f2","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/6pj223f2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Pinhas, Tamar; Zakov, Shay; Tsur, Dekel; &amp; Ziv-Ukelson, Michal. (2013). Efficient edit distance with duplications and contractions. Algorithms for Molecular Biology, 8(1), 27. doi: http://dx.doi.org/10.1186/1748-7188-8-27. Retrieved from: http://www.escholarship.org/uc/item/6pj223f2","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1186/1748-7188-8-27","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-8-27","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-8-27","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6608525468","display_name":null,"funder_award_id":"981/11","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2012746331.pdf","grobid_xml":"https://content.openalex.org/works/W2012746331.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1541872616","https://openalex.org/W1600463518","https://openalex.org/W1647671624","https://openalex.org/W1974688548","https://openalex.org/W1978099269","https://openalex.org/W1980822582","https://openalex.org/W1990061958","https://openalex.org/W1996951465","https://openalex.org/W1997880182","https://openalex.org/W2000191287","https://openalex.org/W2003396524","https://openalex.org/W2012010763","https://openalex.org/W2041397659","https://openalex.org/W2047505657","https://openalex.org/W2074231493","https://openalex.org/W2118062131","https://openalex.org/W2141607439","https://openalex.org/W2610179052","https://openalex.org/W2752885492","https://openalex.org/W3022326557","https://openalex.org/W3145128584","https://openalex.org/W4238290165","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W3044917232","https://openalex.org/W1498160656","https://openalex.org/W2055693471","https://openalex.org/W2119149496","https://openalex.org/W2139858675","https://openalex.org/W2952580779","https://openalex.org/W1537327044","https://openalex.org/W4295101776","https://openalex.org/W123129858"],"abstract_inverted_index":{":":[0],"We":[1],"propose":[2],"three":[3],"algorithms":[4,33],"for":[5,95,175,179,257],"string":[6],"edit":[7],"distance":[8],"with":[9,45,216,261],"duplications":[10],"and":[11,19,40,61,64,71,88,149,177,207,244,288,293],"contractions.":[12],"These":[13],"include":[14],"an":[15,112,199],"efficient":[16,169],"general":[17,37,51],"algorithm":[18,52,113,133,197,232,256,279],"two":[20,103],"improvements":[21],"which":[22,180],"apply":[23],"under":[24],"certain":[25],"constraints":[26],"on":[27,55,167,269],"the":[28,78,83,86,92,96,119,132,137,140,154,158,196,214,238,251,270,278,282,286,299,302,306],"cost":[29,117,263,271],"function.":[30],"The":[31],"new":[32],"solve":[34],"a":[35,187,193,266],"more":[36],"problem":[38],"variant":[39,130],"obtain":[41],"better":[42],"time":[43,63,93,121,151,156,206,255,292],"complexities":[44,66],"respect":[46],"to":[47,111,125,234],"previous":[48],"algorithms.":[49],"Our":[50],"is":[53,77,82,91,122,134,165,298],"based":[54,166],"min-plus":[56,99,171,230],"multiplication":[57,101,172,231],"of":[58,67,85,98,102,131,157,240,277,285,301,305],"square":[59],"matrices":[60,107,176],"has":[62],"space":[65],"O":[68,72],"(|\u03a3|MP":[69],"(n))":[70],"(|\u03a3|n2),":[73],"respectively,":[74],"where":[75,296],"|\u03a3|":[76],"alphabet":[79],"size,":[80],"n":[81,104,106,160,200,202],"length":[84,300],"strings,":[87],"MP":[89],"(n)":[90],"bound":[94],"computation":[97],"matrix":[100,203,215],"\u00d7":[105,201],"(currently,":[108],"MP(n)=On3log3lognlog2n":[109],"due":[110],"by":[114,147],"Chan).For":[115],"integer":[116,189],"functions,":[118],"running":[120],"further":[123],"improved":[124],"O|\u03a3|n3log2n.":[126],"In":[127],"addition,":[128],"this":[129,228],"online,":[135],"in":[136,204,221,248,290],"sense":[138],"that":[139,280],"input":[141],"strings":[142,287],"may":[143,212],"be":[144],"given":[145,161,218],"letter":[146],"letter,":[148],"its":[150],"complexity":[152],"bounds":[153],"processing":[155],"first":[159],"letters.":[162],"This":[163],"acceleration":[164],"our":[168],"matrix-vector":[170,229],"algorithm,":[173],"intended":[174],"vectors":[178],"differences":[181],"between":[182],"adjacent":[183],"entries":[184],"are":[185],"from":[186,237],"finite":[188],"interval":[190],"D.":[191],"Choosing":[192],"constant":[194],"1log|D|n<\u03bb<1,":[195],"preprocesses":[198],"On2+\u03bb|D|":[205],"On2+\u03bb|D|\u03bb2log|D|2n":[208],"space.":[209],"Then,":[210],"it":[211],"multiply":[213],"any":[217],"n-length":[219],"vector":[220],"On2\u03bb2log|D|2n":[222],"time.":[223],"Under":[224],"some":[225],"discreteness":[226],"assumptions,":[227],"applies":[233],"several":[235],"problems":[236],"domains":[239],"context-free":[241],"grammar":[242],"parsing":[243],"RNA":[245,259],"folding":[246,260],"and,":[247],"particular,":[249],"implies":[250],"asymptotically":[252],"fastest":[253],"On3log2n":[254],"single-strand":[258],"discrete":[262],"functions.Finally,":[264],"assuming":[265],"different":[267],"constraint":[268],"function,":[272],"we":[273],"present":[274],"another":[275],"version":[276],"exploits":[281],"run-length":[283,303],"encoding":[284,304],"runs":[289],"O|\u03a3|nMP(\u00f1)\u00f1":[291],"O(|\u03a3|n\u00f1)":[294],"space,":[295],"\u00f1":[297],"strings.":[307]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}