{"id":"https://openalex.org/W1950045300","doi":"https://doi.org/10.1109/spdp.1996.570374","title":"Parallel algorithms for fast computation of normalized edit distances","display_name":"Parallel algorithms for fast computation of normalized edit distances","publication_year":2002,"publication_date":"2002-12-23","ids":{"openalex":"https://openalex.org/W1950045300","doi":"https://doi.org/10.1109/spdp.1996.570374","mag":"1950045300"},"language":"en","primary_location":{"id":"doi:10.1109/spdp.1996.570374","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spdp.1996.570374","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","raw_type":"proceedings-article"},"type":"article","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/A5026125535","display_name":"\u00d6mer E\u011fecio\u01e7lu","orcid":"https://orcid.org/0000-0002-6070-761X"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"O. Egecioglu","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015823862","display_name":"Maximilian Ibel","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Ibel","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026125535"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":0.4169,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.66798228,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":null,"first_page":"496","last_page":"503"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10222","display_name":"Genomics and Chromatin Dynamics","score":0.9532999992370605,"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/edit-distance","display_name":"Edit distance","score":0.7474343776702881},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.7439453601837158},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6205868124961853},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.6064793467521667},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6046668291091919},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5750989317893982},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5109383463859558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4858981966972351},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4785540699958801},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4682268798351288},{"id":"https://openalex.org/keywords/freivalds-algorithm","display_name":"Freivalds' algorithm","score":0.43243762850761414},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4107885956764221},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3630183935165405},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.26211556792259216},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.08782240748405457}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.7474343776702881},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.7439453601837158},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6205868124961853},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.6064793467521667},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6046668291091919},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5750989317893982},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5109383463859558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4858981966972351},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4785540699958801},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4682268798351288},{"id":"https://openalex.org/C38506071","wikidata":"https://www.wikidata.org/wiki/Q6522941","display_name":"Freivalds' algorithm","level":5,"score":0.43243762850761414},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4107885956764221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3630183935165405},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.26211556792259216},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.08782240748405457},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/spdp.1996.570374","is_oa":false,"landing_page_url":"https://doi.org/10.1109/spdp.1996.570374","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W29714126","https://openalex.org/W1501400124","https://openalex.org/W1970026646","https://openalex.org/W1981320868","https://openalex.org/W2006218023","https://openalex.org/W2012010763","https://openalex.org/W2015249958","https://openalex.org/W2093803005","https://openalex.org/W2111643688","https://openalex.org/W2120490947","https://openalex.org/W2149179203","https://openalex.org/W2341171179","https://openalex.org/W2593531062","https://openalex.org/W6734276660"],"related_works":["https://openalex.org/W2084809569","https://openalex.org/W1973589259","https://openalex.org/W1511191949","https://openalex.org/W2043670592","https://openalex.org/W2021227709","https://openalex.org/W1974407206","https://openalex.org/W2951040528","https://openalex.org/W2183767896","https://openalex.org/W2056120647","https://openalex.org/W3204033665"],"abstract_inverted_index":{"The":[0,16],"authors":[1],"give":[2],"work-optimal":[3],"and":[4,24,60,91,125,153],"polylogarithmic":[5,162],"time":[6,69,104,115,166],"parallel":[7],"algorithms":[8],"for":[9],"solving":[10],"the":[11,31,35,38,48,51,114,118,126],"normalized":[12,17],"edit":[13,18,41,52,57],"distance":[14,19],"problem.":[15],"between":[20],"two":[21],"strings":[22],"X":[23,44],"Y":[25,46],"with":[26,67,155],"lengths":[27],"n/spl":[28,96],"ges/m":[29],"is":[30,107,120,131,145],"minimum":[32],"quotient":[33],"of":[34,37,40,50,71,86,95,117,129],"sum":[36],"costs":[39],"operations":[42,130],"transforming":[43],"into":[45],"by":[47],"length":[49],"path":[53],"corresponding":[54],"to":[55,147],"those":[56],"operations.":[58],"Marzal":[59],"Vidal":[61],"(1993)":[62],"proposed":[63],"a":[64,68,93,102,141,161,175],"sequential":[65],"algorithm":[66,78,105,119,138,167],"complexity":[70,116],"O(nm/sup":[72],"2/).":[73],"They":[74,99],"show":[75],"that":[76,106],"this":[77],"can":[79],"be":[80],"parallelized":[81],"work-optimally":[82],"on":[83,92,140,149,169,174],"an":[84],"array":[85],"n":[87],"(or":[88],"m)":[89],"processors,":[90,113],"mesh":[94],"times/m":[97],"processors.":[98],"then":[100],"propose":[101],"sublinear":[103],"almost":[108],"work-optimal:":[109],"using":[110],"O(mn/sup":[111],"1.75/)":[112],"O(n/sup":[121,176],"0.75/":[122],"log":[123,135],"n)":[124,165,178],"total":[127],"number":[128],"O":[132],"(mn/sup":[133],"2.5/":[134],"n).":[136],"This":[137],"runs":[139,173],"CREW":[142],"PRAM,":[143],"but":[144],"likely":[146],"work":[148],"weaker":[150],"PRAM":[151],"models":[152],"hypercubes":[154],"minor":[156],"modifications.":[157],"Finally,":[158],"they":[159],"present":[160],"O(log/sup":[163],"2/":[164],"based":[168],"matrix":[170],"multiplication":[171],"which":[172],"6//log":[177],"processor":[179],"hypercube.":[180]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}