{"id":"https://openalex.org/W7163868791","doi":"https://doi.org/10.4230/lipics.swat.2026.13","title":"Faster Algorithms for Shortest Unique or Absent Substrings","display_name":"Faster Algorithms for Shortest Unique or Absent Substrings","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163868791","doi":"https://doi.org/10.4230/lipics.swat.2026.13"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26049","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.13","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.13/LIPIcs.SWAT.2026.13.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-vol370-swat2026/LIPIcs.SWAT.2026.13/LIPIcs.SWAT.2026.13.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138108504","display_name":"Panagiotis Charalampopoulos","orcid":"https://orcid.org/0000-0002-6024-1557"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Charalampopoulos, Panagiotis","raw_affiliation_strings":["King\u2019s College London, UK"],"raw_orcid":"https://orcid.org/0000-0002-6024-1557","affiliations":[{"raw_affiliation_string":"King\u2019s College London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053465015","display_name":"Manal Mohamed","orcid":"https://orcid.org/0000-0002-1435-5051"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mohamed, Manal","raw_affiliation_strings":["King\u2019s College London, UK"],"raw_orcid":"https://orcid.org/0000-0002-1435-5051","affiliations":[{"raw_affiliation_string":"King\u2019s College London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051275317","display_name":"Solon P. Pissis","orcid":"https://orcid.org/0000-0002-1445-1932"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I148518341","display_name":"Cyprus Institute","ror":"https://ror.org/01q8k8p90","country_code":"CY","type":"other","lineage":["https://openalex.org/I148518341"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["CY","NL"],"is_corresponding":false,"raw_author_name":"Pissis, Solon P.","raw_affiliation_strings":["The Cyprus Institute, Nicosia, Cyprus","CWI, Amsterdam, The Netherlands","Vrije Universiteit Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-1445-1932","affiliations":[{"raw_affiliation_string":"The Cyprus Institute, Nicosia, Cyprus","institution_ids":["https://openalex.org/I148518341"]},{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Vrije Universiteit Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112280844","display_name":"Hilde Verbeek","orcid":"https://orcid.org/0000-0002-2399-3098"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Verbeek, Hilde","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-2399-3098","affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083139616","display_name":"Wiktor Zuba","orcid":"https://orcid.org/0000-0002-1988-3507"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Zuba, Wiktor","raw_affiliation_strings":["University of Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0002-1988-3507","affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"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.94195563,"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.9503999948501587,"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.9503999948501587,"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/T11567","display_name":"semigroups and automata theory","score":0.01769999973475933,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.005100000184029341,"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.9509000182151794},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.6051999926567078},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.5841000080108643},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.5773000121116638},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5206999778747559},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4846000075340271},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.46869999170303345},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.45010000467300415},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.429500013589859},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.41830000281333923}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.9509000182151794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6244000196456909},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.6051999926567078},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.5841000080108643},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.5773000121116638},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5206999778747559},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48809999227523804},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4846000075340271},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.46869999170303345},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.45010000467300415},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.429500013589859},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4271000027656555},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.41830000281333923},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4092000126838684},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.40049999952316284},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.3944000005722046},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3833000063896179},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35569998621940613},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.35109999775886536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3294000029563904},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31299999356269836},{"id":"https://openalex.org/C3019641298","wikidata":"https://www.wikidata.org/wiki/Q625642","display_name":"Word length","level":2,"score":0.30410000681877136},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.2648000121116638},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2515999972820282},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2515999972820282},{"id":"https://openalex.org/C13052355","wikidata":"https://www.wikidata.org/wiki/Q5152399","display_name":"Commentz-Walter algorithm","level":4,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26049","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.13","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.13/LIPIcs.SWAT.2026.13.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.swat.2026.13","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.13","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:26049","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.13","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.13/LIPIcs.SWAT.2026.13.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/W7163868791.pdf","grobid_xml":"https://content.openalex.org/works/W7163868791.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,80],"revisit":[1],"two":[2],"well-known":[3],"algorithmic":[4],"problems":[5,28],"on":[6],"strings:":[7],"computing":[8,89,166],"a":[9,15,21,55,90,132,135,167],"shortest":[10,16],"unique":[11],"substring":[12,18,109],"(SUS)":[13],"and":[14,72,103,110,114,124,144],"absent":[17],"(SAS)":[19],"in":[20,49,66,74,92,155,169],"string":[22,56],"S":[23],"of":[24,37,57,106,122,131,151],"length":[25,58,102],"n.":[26],"Both":[27],"admit":[29],"folklore":[30],"\ud835\udcaa(n)-time":[31],"solutions":[32],"using":[33],"the":[34,50,97,101,104,107,120,129],"suffix":[35],"tree":[36],"S.":[38,93,170],"However,":[39],"for":[40,88,165],"small":[41],"alphabets,":[42],"this":[43,142],"complexity":[44],"is":[45],"not":[46],"necessarily":[47],"optimal":[48],"word":[51],"RAM":[52],"model,":[53],"where":[54],"n":[59],"over":[60],"alphabet":[61],"[0,\u03c3)":[62],"can":[63],"be":[64],"stored":[65],"\ud835\udcaa(n":[67,75,83,160],"log":[68,76,84,161],"\u03c3/log":[69,77],"n)":[70,78],"space":[71],"read":[73],"time.":[79],"present":[81],"an":[82,148,159],"\u03c3/\u221a{log":[85,162],"n})-time":[86,163],"algorithm":[87,95,143,164],"SUS":[91,133],"This":[94],"decomposes":[96],"problem":[98],"according":[99],"to":[100,127,134,157],"period":[105],"sought":[108],"uses":[111],"several":[112],"tools":[113],"techniques,":[115],"such":[116],"as":[117],"synchronizing":[118],"sets,":[119],"analysis":[121],"runs,":[123],"wavelet":[125],"trees,":[126],"reduce":[128],"computation":[130],"simple":[136],"geometric":[137],"problem.":[138],"Further,":[139],"we":[140],"adapt":[141],"combine":[145],"it":[146],"with":[147],"efficient":[149],"construction":[150],"de":[152],"Bruijn":[153],"sequences":[154],"order":[156],"obtain":[158],"SAS":[168]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}
