{"id":"https://openalex.org/W6963702620","doi":"https://doi.org/10.2312/egpgv/egpgv08/057-064","title":"Parallel Longest Common Subsequence using Graphics Hardware","display_name":"Parallel Longest Common Subsequence using Graphics Hardware","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W6963702620","doi":"https://doi.org/10.2312/egpgv/egpgv08/057-064"},"language":"en","primary_location":{"id":"doi:10.2312/egpgv/egpgv08/057-064","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/057-064","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2312/egpgv/egpgv08/057-064","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Kloetzli, John","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kloetzli, John","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Strege, Brian","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Strege, Brian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Decker, Jonathan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Decker, Jonathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Olano, Marc","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Olano, Marc","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6987000107765198},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6039999723434448},{"id":"https://openalex.org/keywords/graphics-hardware","display_name":"Graphics hardware","score":0.5935999751091003},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.5562000274658203},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5356000065803528},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.5115000009536743},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4636000096797943},{"id":"https://openalex.org/keywords/cuda","display_name":"CUDA","score":0.4523000121116638},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.44859999418258667}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7910000085830688},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7245000004768372},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6987000107765198},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6039999723434448},{"id":"https://openalex.org/C18945957","wikidata":"https://www.wikidata.org/wiki/Q5597193","display_name":"Graphics hardware","level":3,"score":0.5935999751091003},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.5562000274658203},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5356000065803528},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.5115000009536743},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4636000096797943},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.4523000121116638},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.44859999418258667},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4397999942302704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43639999628067017},{"id":"https://openalex.org/C2779851693","wikidata":"https://www.wikidata.org/wiki/Q183484","display_name":"Graphics processing unit","level":2,"score":0.366100013256073},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3447999954223633},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.30709999799728394},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.30309998989105225},{"id":"https://openalex.org/C77660652","wikidata":"https://www.wikidata.org/wiki/Q150971","display_name":"Computer graphics","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C18766215","wikidata":"https://www.wikidata.org/wiki/Q7708532","display_name":"Texture memory","level":5,"score":0.28380000591278076},{"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.2809999883174896},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25450000166893005},{"id":"https://openalex.org/C126312332","wikidata":"https://www.wikidata.org/wiki/Q2658","display_name":"Gaussian elimination","level":3,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2312/egpgv/egpgv08/057-064","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/057-064","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.2312/egpgv/egpgv08/057-064","is_oa":true,"landing_page_url":"https://doi.org/10.2312/egpgv/egpgv08/057-064","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,16,66],"present":[1],"an":[2],"algorithm":[3,71,78],"for":[4],"solving":[5],"the":[6,40,57,73,80,105,119],"Longest":[7,106],"Common":[8,107],"Subsequence":[9,108],"problem":[10],"using":[11,46,75],"graphics":[12],"hardware":[13,34,59],"accel-":[14],"eration.":[15],"identify":[17],"a":[18,47,68,76,94,98],"parallel":[19,33,131],"memory":[20,61],"access":[21],"pattern":[22],"which":[23,43],"enables":[24],"us":[25],"to":[26,39,82,104,115,127],"run":[27],"efficiently":[28],"on":[29,72,79,93],"multiple":[30],"layers":[31],"of":[32,49,56,63,89,130],"by":[35],"matching":[36],"each":[37,64],"layer":[38],"best":[41],"sub-algorithm,":[42],"is":[44,97,113],"determined":[45],"mix":[48],"theoretical":[50],"and":[51,60,101,123],"experimental":[52],"data":[53],"including":[54],"knowledge":[55],"specific":[58],"structure":[62],"layer.":[65],"implement":[67],"linear-space,":[69],"cache-coherent":[70],"CPU,":[74],"two-level":[77],"GPU":[81,135],"com-":[83],"pute":[84],"subproblems":[85],"quickly.":[86],"The":[87],"combination":[88],"all":[90],"three":[91],"running":[92],"CPU/GPU":[95],"pair":[96],"fast,":[99],"flexible":[100],"scalable":[102],"solution":[103],"problem.":[109],"Our":[110],"design":[111],"method":[112],"applicable":[114],"other":[116],"algorithms":[117],"in":[118],"Gaussian":[120],"Elimination":[121],"Paradigm,":[122],"can":[124],"be":[125],"generalized":[126],"more":[128],"levels":[129],"computation":[132],"such":[133],"as":[134],"clusters.":[136]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}