{"id":"https://openalex.org/W7135199577","doi":"https://doi.org/10.1109/iccp68926.2025.11427148","title":"Parallel String Matching on GPU: An Evaluation of KMP, Boyer-Moore, and BWT with CUDA","display_name":"Parallel String Matching on GPU: An Evaluation of KMP, Boyer-Moore, and BWT with CUDA","publication_year":2025,"publication_date":"2025-10-16","ids":{"openalex":"https://openalex.org/W7135199577","doi":"https://doi.org/10.1109/iccp68926.2025.11427148"},"language":null,"primary_location":{"id":"doi:10.1109/iccp68926.2025.11427148","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccp68926.2025.11427148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Intelligent Computer Communication and Processing (ICCP)","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/A5128970899","display_name":"Petre Mihai Bogdan","orcid":null},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transylvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Petre Mihai Bogdan","raw_affiliation_strings":["University Transilvania of Brasov,Brasov,Romania"],"affiliations":[{"raw_affiliation_string":"University Transilvania of Brasov,Brasov,Romania","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129089547","display_name":"T\u0103b\u00eerc\u0103 Marius Sabin","orcid":null},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transylvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"T\u0103b\u00eerc\u0103 Marius Sabin","raw_affiliation_strings":["University Transilvania of Brasov,Brasov,Romania"],"affiliations":[{"raw_affiliation_string":"University Transilvania of Brasov,Brasov,Romania","institution_ids":["https://openalex.org/I3123573182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5128970899"],"corresponding_institution_ids":["https://openalex.org/I3123573182"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.88333299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.4952000081539154,"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.4952000081539154,"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.2597000002861023,"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/T11309","display_name":"Music and Audio Processing","score":0.04800000041723251,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/cuda","display_name":"CUDA","score":0.5971999764442444},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.47099998593330383},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4088999927043915},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.2623000144958496}],"concepts":[{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.5971999764442444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5802000164985657},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4142000079154968},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4088999927043915},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3544999957084656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34790000319480896},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28040000796318054},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.2621999979019165},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccp68926.2025.11427148","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccp68926.2025.11427148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Intelligent Computer Communication and Processing (ICCP)","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":4,"referenced_works":["https://openalex.org/W158435175","https://openalex.org/W2003796057","https://openalex.org/W2148016496","https://openalex.org/W4398200001"],"related_works":[],"abstract_inverted_index":{"String":[0],"processing":[1],"is":[2],"a":[3],"fundamental":[4],"component":[5],"of":[6,46,56,65,85],"numerous":[7],"applications":[8],"in":[9,16],"computer":[10],"science,":[11],"with":[12,51],"particularly":[13],"critical":[14],"roles":[15],"areas":[17],"such":[18],"as":[19],"bioinformatics,":[20,27],"text":[21],"mining,":[22],"and":[23,39,54,78,82,88,109,114],"data":[24,58],"compression.":[25],"In":[26],"efficient":[28],"string":[29,47,67],"matching":[30],"underpins":[31],"essential":[32],"tasks":[33],"like":[34],"genome":[35],"alignment,":[36],"motif":[37],"searching,":[38],"sequence":[40],"assembly.":[41],"However,":[42],"traditional":[43],"CPU-based":[44],"implementations":[45],"algorithms":[48,68],"often":[49],"struggle":[50],"the":[52,63,80],"scale":[53],"complexity":[55],"modern":[57],"sets.":[59],"This":[60],"review":[61,96],"explores":[62],"acceleration":[64],"classical":[66],"using":[69],"NVIDIA\u2019s":[70],"CUDA":[71],"platform":[72],"for":[73],"GPU":[74],"computing.":[75],"We":[76],"examine":[77],"compare":[79],"performance":[81],"parallelization":[83],"strategies":[84],"Knuth-MorrisPratt,":[86],"Boyer-Moore":[87],"Burrows-Wheeler":[89],"Transform":[90],"when":[91],"implemented":[92],"on":[93],"GPUs.":[94],"The":[95],"analyzes":[97],"how":[98],"each":[99],"algorithm\u2019s":[100],"structure":[101],"affects":[102],"its":[103],"adaptability":[104],"to":[105],"CUDA\u2019s":[106],"parallel":[107],"architecture,":[108],"evaluates":[110],"their":[111],"speedup,":[112],"scalability,":[113],"memory":[115],"efficiency":[116],"across":[117],"varying":[118],"input":[119],"sizes.":[120]},"counts_by_year":[],"updated_date":"2026-03-15T07:15:06.534987","created_date":"2026-03-14T00:00:00"}