{"id":"https://openalex.org/W7161109129","doi":"https://doi.org/10.1109/dcc66757.2026.00091","title":"Optimized Merge-Sort for Parameterized Suffix Array Construction","display_name":"Optimized Merge-Sort for Parameterized Suffix Array Construction","publication_year":2026,"publication_date":"2026-03-24","ids":{"openalex":"https://openalex.org/W7161109129","doi":"https://doi.org/10.1109/dcc66757.2026.00091"},"language":null,"primary_location":{"id":"doi:10.1109/dcc66757.2026.00091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc66757.2026.00091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 Data Compression Conference (DCC)","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/A5004277983","display_name":"Lalita Sthapit","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lalita Sthapit","raw_affiliation_strings":["Louisiana State University 3325 Patrick F. Taylor Hall Baton Rouge,LA,USA,70803"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Louisiana State University 3325 Patrick F. Taylor Hall Baton Rouge,LA,USA,70803","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5136126797","display_name":"Rahul Shah","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rahul Shah","raw_affiliation_strings":["Louisiana State University 3325 Patrick F. Taylor Hall Baton Rouge,LA,USA,70803"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Louisiana State University 3325 Patrick F. Taylor Hall Baton Rouge,LA,USA,70803","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004277983"],"corresponding_institution_ids":["https://openalex.org/I121820613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.9463618,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"464","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7098000049591064,"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.7098000049591064,"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/T12029","display_name":"DNA and Biological Computing","score":0.10040000081062317,"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"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.021199999377131462,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.34689998626708984},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.335099995136261},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.26460000872612},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.2533000111579895}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5123000144958496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4569999873638153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39890000224113464},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30970001220703125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2913999855518341},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28610000014305115},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.26460000872612},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.2533000111579895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dcc66757.2026.00091","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc66757.2026.00091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 Data Compression Conference (DCC)","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Parameterized":[0],"pattern":[1,5],"matching":[2,6],"extends":[3],"classical":[4,58],"by":[7],"allowing":[8],"alphabet":[9],"symbols":[10,89],"to":[11,53,80,176],"be":[12],"remapped":[13],"under":[14],"a":[15,45,71,84,156],"bijection.":[16],"To":[17],"support":[18],"such":[19,169],"queries,":[20],"the":[21,27,32,51,61,73,145,152,162,178],"parameterized":[22,35,42,88,141,181],"suffix":[23,59,91,142],"array":[24],"(pSA)":[25],"indexes":[26],"previous-encoded":[28],"version":[29],"of":[30,34,75,97,109,147,154],"all":[31],"suffixes":[33,77],"string.":[36],"In":[37,127],"this":[38,128],"encoding,":[39],"every":[40],"repeated":[41],"symbol":[43],"in":[44,63,124],"string":[46],"S":[47],"is":[48],"replaced":[49],"with":[50],"distance":[52],"its":[54],"previous":[55],"occurrence.":[56],"Unlike":[57],"arrays,":[60],"suffix-ordering":[62],"pSA":[64,98,149],"depends":[65],"on":[66,101,161],"each":[67],"suffix's":[68],"previous-encoding.":[69],"As":[70],"result,":[72],"comparison":[74],"two":[76,132],"requires":[78],"algorithms":[79],"maintain":[81],"and":[82,174],"update":[83],"dynamic":[85],"mapping":[86],"between":[87,180],"during":[90,140],"comparisons.":[92],"Existing":[93],"theoretically":[94],"efficient":[95],"methods":[96,159],"construction":[99,150],"based":[100],"pST":[102],"are":[103],"memory":[104],"intensive.":[105],"A":[106],"naive":[107],"method":[108],"sorting":[110],"suffixes,":[111],"say":[112],"using":[113],"merge":[114],"sort,":[115],"could":[116],"take":[117],"<tex":[118],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[119],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O\\left(n^{2}":[120],"\\text{logn}\\right)$</tex>":[121],"character-wise":[122],"comparisons":[123,139],"worst":[125],"case.":[126],"work,":[129],"we":[130],"present":[131],"optimized":[133],"techniques":[134],"that":[135],"significantly":[136],"reduce":[137],"redundant":[138],"sorting,":[143],"improving":[144],"process":[146],"direct":[148],"without":[151],"overhead":[153],"building":[155],"pST.":[157],"Both":[158],"work":[160],"merge-sort":[163],"framework,":[164],"uses":[165],"previously":[166],"computed":[167],"information":[168],"as":[170],"common":[171],"prefix":[172],"length":[173],"ranks":[175],"find":[177],"ordering":[179],"suffixes.":[182]},"counts_by_year":[],"updated_date":"2026-05-16T06:04:12.930555","created_date":"2026-05-15T00:00:00"}