{"id":"https://openalex.org/W2643961097","doi":"https://doi.org/10.1145/2578948.2560690","title":"Fast Longest Common Subsequence with General Integer Scoring Support on GPUs","display_name":"Fast Longest Common Subsequence with General Integer Scoring Support on GPUs","publication_year":2014,"publication_date":"2014-02-07","ids":{"openalex":"https://openalex.org/W2643961097","doi":"https://doi.org/10.1145/2578948.2560690","mag":"2643961097"},"language":"en","primary_location":{"id":"doi:10.1145/2578948.2560690","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2578948.2560690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of Programming Models and Applications on Multicores and Manycores","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/A5045229743","display_name":"Adnan \u00d6zsoy","orcid":"https://orcid.org/0000-0002-0302-3721"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adnan Ozsoy","raw_affiliation_strings":["Indiana University, Bloomington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102865110","display_name":"Arun Chauhan","orcid":"https://orcid.org/0000-0002-0327-7254"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arun Chauhan","raw_affiliation_strings":["Indiana University, Bloomington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044461835","display_name":"Martin Swany","orcid":"https://orcid.org/0000-0001-8028-1161"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Swany","raw_affiliation_strings":["Indiana University, Bloomington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington","institution_ids":["https://openalex.org/I4210119109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210119109"],"apc_list":null,"apc_paid":null,"fwci":1.2425,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86314475,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"92","last_page":"102"},"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.9965999722480774,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.8480410575866699},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.747031033039093},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6988918781280518},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6919660568237305},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6182504892349243},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.5997985601425171},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5801980495452881},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.5753408074378967},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5100513100624084},{"id":"https://openalex.org/keywords/general-purpose-computing-on-graphics-processing-units","display_name":"General-purpose computing on graphics processing units","score":0.432238906621933},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42671605944633484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3411110043525696},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.18011650443077087},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.1318821907043457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08879011869430542}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8480410575866699},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.747031033039093},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6988918781280518},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6919660568237305},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6182504892349243},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.5997985601425171},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5801980495452881},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.5753408074378967},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5100513100624084},{"id":"https://openalex.org/C50630238","wikidata":"https://www.wikidata.org/wiki/Q971505","display_name":"General-purpose computing on graphics processing units","level":3,"score":0.432238906621933},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42671605944633484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3411110043525696},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.18011650443077087},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.1318821907043457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08879011869430542},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2578948.2560690","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2578948.2560690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of Programming Models and Applications on Multicores and Manycores","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1498160656","https://openalex.org/W1560652324","https://openalex.org/W1590029928","https://openalex.org/W1647671624","https://openalex.org/W1970026646","https://openalex.org/W2011652244","https://openalex.org/W2019565515","https://openalex.org/W2029475416","https://openalex.org/W2058978608","https://openalex.org/W2068472240","https://openalex.org/W2071184135","https://openalex.org/W2074231493","https://openalex.org/W2087064593","https://openalex.org/W2090075793","https://openalex.org/W2093513138","https://openalex.org/W2100751585","https://openalex.org/W2110372165","https://openalex.org/W2118874283","https://openalex.org/W2130200371","https://openalex.org/W2133540884","https://openalex.org/W2142667471","https://openalex.org/W2162744351","https://openalex.org/W2165654401","https://openalex.org/W2223649089","https://openalex.org/W2560137734","https://openalex.org/W4241377887","https://openalex.org/W4300457049","https://openalex.org/W6635692132"],"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":{"Graphic":[0],"Processing":[1],"Units":[2],"(GPUs)":[3],"have":[4,39],"been":[5,40],"gaining":[6],"popularity":[7],"among":[8],"high-performance":[9],"users.":[10],"Certain":[11],"classes":[12],"of":[13,21,26,78,81],"algorithms":[14,27,91],"benefit":[15],"greatly":[16],"from":[17],"the":[18,51,55,75,79,89,110],"massive":[19],"parallelism":[20],"GPUs.":[22,49],"One":[23],"such":[24],"class":[25],"is":[28],"longest":[29],"common":[30],"subsequence":[31],"(LCS).":[32],"Combined":[33],"with":[34,61],"bit":[35],"parallelism,":[36],"recent":[37],"studies":[38],"able":[41],"to":[42,73,94],"achieve":[43],"terascale":[44],"performance":[45,122],"for":[46,54,84,92,101,118],"LCS":[47,82,93],"on":[48,115,123],"However,":[50],"reported":[52],"results":[53],"one-to-many":[56],"matching":[57],"problem":[58],"lack":[59],"correlation":[60],"weighted":[62],"scoring":[63,97],"algorithms.":[64],"In":[65],"this":[66],"paper,":[67],"we":[68],"describe":[69],"a":[70],"novel":[71],"technique":[72],"improve":[74],"score":[76],"significance":[77],"length":[80],"algorithm":[83,108,114],"multiple":[85],"matching.":[86],"We":[87,105],"extend":[88],"bit-vector":[90],"include":[95],"integer":[96],"and":[98,120],"parallelize":[99],"them":[100],"hybrid":[102],"CPU-GPU":[103],"platforms.":[104],"benchmark":[106],"our":[107],"against":[109],"well-known":[111],"sequence":[112],"alignment":[113],"GPUs,":[116],"CUDASW++,":[117],"accuracy":[119],"report":[121],"three":[124],"different":[125],"systems.":[126]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}