{"id":"https://openalex.org/W7163954942","doi":"https://doi.org/10.4230/lipics.cpm.2026.8","title":"Constant Multiplicative Sensitivity on the CDAWGs","display_name":"Constant Multiplicative Sensitivity on the CDAWGs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163954942","doi":"https://doi.org/10.4230/lipics.cpm.2026.8"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25934","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.8/LIPIcs.CPM.2026.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.8/LIPIcs.CPM.2026.8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107124509","display_name":"Rikuya Hamai","orcid":null},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hamai, Rikuya","raw_affiliation_strings":["Department of Information Science and Technology, Kyushu University, Fukuoka, Japan"],"raw_orcid":"https://orcid.org/0009-0006-9575-3911","affiliations":[{"raw_affiliation_string":"Department of Information Science and Technology, Kyushu University, Fukuoka, Japan","institution_ids":["https://openalex.org/I135598925"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017230590","display_name":"Hiroto Fujimaru","orcid":null},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Fujimaru, Hiroto","raw_affiliation_strings":["Department of Information Science and Technology, Kyushu University, Fukuoka, Japan"],"raw_orcid":"https://orcid.org/0009-0001-0690-7442","affiliations":[{"raw_affiliation_string":"Department of Information Science and Technology, Kyushu University, Fukuoka, Japan","institution_ids":["https://openalex.org/I135598925"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012002493","display_name":"Shunsuke Inenaga","orcid":"https://orcid.org/0000-0002-1833-010X"},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Inenaga, Shunsuke","raw_affiliation_strings":["Department of Informatics, Kyushu University, Fukuoka, Japan"],"raw_orcid":"https://orcid.org/0000-0002-1833-010X","affiliations":[{"raw_affiliation_string":"Department of Informatics, Kyushu University, Fukuoka, Japan","institution_ids":["https://openalex.org/I135598925"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.95053217,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.986299991607666,"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.986299991607666,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.003100000089034438,"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"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.002099999925121665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.8050000071525574},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6906999945640564},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6456999778747559},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.5615000128746033},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5403000116348267},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.5388000011444092},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4918000102043152},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.4909000098705292},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.478300005197525},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.4440000057220459}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8050000071525574},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6906999945640564},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6456999778747559},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6093999743461609},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.5615000128746033},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5403000116348267},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.5388000011444092},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4918000102043152},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4909000098705292},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.478300005197525},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.4440000057220459},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4413999915122986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4352000057697296},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.42500001192092896},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.41510000824928284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3862999975681305},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.37790000438690186},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.3734000027179718},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.33959999680519104},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.33570000529289246},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.31940001249313354},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.30300000309944153},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.3018999993801117},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C25797200","wikidata":"https://www.wikidata.org/wiki/Q828137","display_name":"Compression ratio","level":3,"score":0.27410000562667847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27250000834465027},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.25220000743865967}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25934","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.8/LIPIcs.CPM.2026.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.cpm.2026.8","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.8","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25934","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.8","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.8/LIPIcs.CPM.2026.8.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163954942.pdf","grobid_xml":"https://content.openalex.org/works/W7163954942.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Compact":[0],"directed":[1],"acyclic":[2],"word":[3],"graphs":[4],"(CDAWGs)":[5],"[Blumer":[6],"et":[7,137],"al.":[8,138],"1987]":[9],"are":[10,55],"a":[11,32,56,126,167],"fundamental":[12],"data":[13,23,108,116,121,152],"structure":[14,117],"on":[15,195,217],"strings":[16],"with":[17],"applications":[18],"in":[19,68,99,149,178],"text":[20],"pattern":[21,26,84],"searching,":[22],"compression,":[24],"and":[25,52,94,123],"discovery.":[27],"Intuitively,":[28],"the":[29,42,48,61,79,114,131,143,146,150,162,179,186,189,205,209,218,226],"CDAWG":[30,62,80,190,207],"of":[31,41,47,133,145,164,188],"string":[33,50,181],"T":[34,196],"is":[35,111,118,172,197],"obtained":[36],"by":[37],"merging":[38],"isomorphic":[39],"subtrees":[40],"suffix":[43],"tree":[44],"[Weiner":[45],"1973]":[46],"same":[49],"T,":[51],"thus":[53],"CDAWGs":[54,165],"compact":[57],"indexing":[58],"structure.":[59],"Indeed,":[60],"size":[63,147,187],"\ud835\uddbe":[64],"can":[65],"be":[66],"sublinear":[67],"n":[69],"for":[70,82,129,225],"some":[71],"highly":[72],"repetitive":[73],"strings.":[74],"Of":[75],"its":[76],"various":[77],"applications,":[78],"allows":[81],"computing":[83],"occurrences,":[85],"maximal":[86],"exact":[87],"matches":[88],"(MEMs),":[89],"minimal":[90,95],"absent":[91],"words":[92],"(MAWs),":[93],"unique":[96],"substrings":[97],"(MUSs)":[98],"optimal":[100],"time":[101],"using":[102],"O(\ud835\uddbe)":[103],"space.":[104],"For":[105],"designing":[106],"space-efficient":[107],"storage,":[109],"it":[110],"crucial":[112],"that":[113,185],"underlying":[115],"robust":[119],"against":[120],"edits":[122,155],"errors.":[124],"As":[125],"mathematical":[127],"measure":[128],"this,":[130],"notion":[132],"compression":[134],"sensitivity":[135,163],"[Akagi":[136],"2023]":[139],"was":[140],"introduced":[141],"as":[142],"maximum":[144],"increase":[148],"compressed":[151],"structures":[153],"after":[154,191],"operations.":[156],"In":[157],"this":[158],"paper,":[159],"we":[160],"investigate":[161],"when":[166],"single":[168],"character":[169],"edit":[170,193],"operation":[171,194],"performed":[173],"at":[174,199],"an":[175,192],"arbitrary":[176],"position":[177],"input":[180],"T.":[182],"We":[183],"show":[184],"asymptotically":[198],"most":[200],"8":[201],"times":[202],"larger":[203],"than":[204],"original":[206],"before":[208],"edit.":[210],"This":[211],"O(1)":[212],"upper":[213,221],"bound":[214,222],"significantly":[215],"improves":[216],"only":[219],"known":[220],"O(n/log":[223],"n)":[224],"problem.":[227]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}