{"id":"https://openalex.org/W3203750076","doi":"https://doi.org/10.1145/3472456.3472489","title":"Efficient Parallel Algorithms for String Comparison","display_name":"Efficient Parallel Algorithms for String Comparison","publication_year":2021,"publication_date":"2021-08-09","ids":{"openalex":"https://openalex.org/W3203750076","doi":"https://doi.org/10.1145/3472456.3472489","mag":"3203750076"},"language":"en","primary_location":{"id":"doi:10.1145/3472456.3472489","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3472456.3472489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"50th International Conference on Parallel 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/A5087408653","display_name":"Nikita Mishin","orcid":null},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Nikita Mishin","raw_affiliation_strings":["Saint Petersburg State University, JetBrains Research, Russia"],"affiliations":[{"raw_affiliation_string":"Saint Petersburg State University, JetBrains Research, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035437757","display_name":"Daniil Berezun","orcid":"https://orcid.org/0000-0001-6306-275X"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Daniil Berezun","raw_affiliation_strings":["Saint Petersburg State University, JetBrains Research, Russia"],"affiliations":[{"raw_affiliation_string":"Saint Petersburg State University, JetBrains Research, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057408760","display_name":"Alexander Tiskin","orcid":"https://orcid.org/0000-0003-0680-4192"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander Tiskin","raw_affiliation_strings":["Saint Petersburg State University, Russia"],"affiliations":[{"raw_affiliation_string":"Saint Petersburg State University, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5087408653"],"corresponding_institution_ids":["https://openalex.org/I172901346"],"apc_list":null,"apc_paid":null,"fwci":0.136,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55514285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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.9965000152587891,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9829000234603882,"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.9436529874801636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7009723782539368},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.6672469973564148},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5852425694465637},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5757417678833008},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5600320100784302},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.45918530225753784},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.42775362730026245},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.40134796500205994},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3984268009662628},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21816223859786987},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.1634935736656189},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12818804383277893}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9436529874801636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7009723782539368},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.6672469973564148},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5852425694465637},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5757417678833008},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5600320100784302},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45918530225753784},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.42775362730026245},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.40134796500205994},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3984268009662628},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21816223859786987},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.1634935736656189},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12818804383277893},{"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},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3472456.3472489","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3472456.3472489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"50th International Conference on Parallel 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":23,"referenced_works":["https://openalex.org/W1591186305","https://openalex.org/W1889224378","https://openalex.org/W1970026646","https://openalex.org/W1990413869","https://openalex.org/W1998730018","https://openalex.org/W2012010763","https://openalex.org/W2045271686","https://openalex.org/W2052899946","https://openalex.org/W2060296641","https://openalex.org/W2068472240","https://openalex.org/W2070320107","https://openalex.org/W2075871133","https://openalex.org/W2078611081","https://openalex.org/W2095950337","https://openalex.org/W2106184136","https://openalex.org/W2128703518","https://openalex.org/W2147602940","https://openalex.org/W2165654401","https://openalex.org/W2597767755","https://openalex.org/W3041766674","https://openalex.org/W3101942351","https://openalex.org/W3137678020","https://openalex.org/W4253069684"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W1974063126","https://openalex.org/W2969919693","https://openalex.org/W4225868058","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":{"The":[0],"longest":[1],"common":[2],"subsequence":[3],"(LCS)":[4],"problem":[5,14],"on":[6],"a":[7,12,25,65,77],"pair":[8],"of":[9,29,52,86,93],"strings":[10],"is":[11],"classical":[13],"in":[15,36],"string":[16],"algorithms.":[17],"Its":[18],"extension,":[19],"the":[20,30,50,70,83,87],"semi-local":[21,41,71],"LCS":[22,42,72,80,99],"problem,":[23],"provides":[24],"more":[26],"detailed":[27],"comparison":[28],"input":[31],"strings,":[32],"without":[33],"any":[34],"increase":[35],"asymptotic":[37],"running":[38],"time.":[39],"Several":[40],"algorithms":[43,100],"have":[44,56],"been":[45,58],"proposed":[46],"previously;":[47],"however,":[48],"to":[49,69],"best":[51],"our":[53],"knowledge,":[54],"none":[55],"yet":[57],"implemented.":[59],"In":[60,82],"this":[61],"paper,":[62,88],"we":[63,89],"explore":[64],"new":[66,97],"hybrid":[67],"approach":[68],"problem.":[73],"We":[74],"also":[75],"propose":[76],"novel":[78],"bit-parallel":[79],"algorithm.":[81],"experimental":[84],"part":[85],"present":[90],"an":[91],"implementation":[92],"several":[94],"existing":[95],"and":[96,101],"parallel":[98],"evaluate":[102],"their":[103],"performance.":[104]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}