{"id":"https://openalex.org/W6910246783","doi":"https://doi.org/10.4230/lipics.cpm.2025.24","title":"Sorted Consecutive Occurrence Queries in Substrings","display_name":"Sorted Consecutive Occurrence Queries in Substrings","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6910246783","doi":"https://doi.org/10.4230/lipics.cpm.2025.24"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23118","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.24","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.24/LIPIcs.CPM.2025.24.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":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.24/LIPIcs.CPM.2025.24.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Akram, Waseem","orcid":"https://orcid.org/0009-0007-4960-8673"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Akram, Waseem","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India"],"raw_orcid":"https://orcid.org/0009-0007-4960-8673","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mieno, Takuya","orcid":"https://orcid.org/0000-0003-2922-9434"},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Mieno, Takuya","raw_affiliation_strings":["Department of Computer and Network Engineering, University of Electro-Communications, Chofu, Japan"],"raw_orcid":"https://orcid.org/0000-0003-2922-9434","affiliations":[{"raw_affiliation_string":"Department of Computer and Network Engineering, University of Electro-Communications, Chofu, Japan","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2331,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.86726679,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9427000284194946,"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.9427000284194946,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.025299999862909317,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.007400000002235174,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.902400016784668},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.573199987411499},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5254999995231628},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.5209000110626221},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5182999968528748},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5113999843597412},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.48019999265670776},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4797999858856201}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.902400016784668},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.573199987411499},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5425999760627747},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5254999995231628},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.5209000110626221},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5182999968528748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5144000053405762},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5113999843597412},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.48019999265670776},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4797999858856201},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.45590001344680786},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4377000033855438},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","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.4000999927520752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.367000013589859},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.304500013589859},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.29600000381469727},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.28679999709129333},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2720000147819519},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2718999981880188},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:23118","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.24","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.24/LIPIcs.CPM.2025.24.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":"InProceedings"},{"id":"doi:10.4230/lipics.cpm.2025.24","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2025.24","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:23118","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2025.24","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol331-cpm2025/LIPIcs.CPM.2025.24/LIPIcs.CPM.2025.24.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":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6910246783.pdf","grobid_xml":"https://content.openalex.org/works/W6910246783.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"string":[1],"indexing":[2],"problem":[3,8,72],"is":[4,47,239],"a":[5,27,36,43,68,100,173,240,264],"fundamental":[6],"computational":[7],"with":[9,147],"numerous":[10],"applications,":[11],"including":[12],"information":[13],"retrieval":[14],"and":[15,35,59,243],"bioinformatics.":[16],"It":[17],"aims":[18],"to":[19,48,160],"efficiently":[20],"solve":[21],"the":[22,45,74,94,116,124,161,196,222,246],"pattern":[23,37],"matching":[24],"problem:":[25],"given":[26],"text":[28],"T":[29,88],"of":[30,39,52,56,70,82,85,129,137,170,178,248,269],"length":[31,40],"n":[32,207,233],"for":[33,256],"preprocessing":[34],"P":[38,53,86,130,171],"m":[41],"as":[42,54,183,251],"query,":[44,78,121],"goal":[46],"report":[49],"all":[50],"occurrences":[51,84,128,169],"substrings":[55],"T.":[57,179],"Navarro":[58],"Thankachan":[60],"[CPM":[61],"2015,":[62],"Theor.":[63,111],"Comput.":[64,112],"Sci.":[65,113],"2016]":[66],"introduced":[67],"variant":[69],"this":[71,154],"called":[73],"gap-bounded":[75,224],"consecutive":[76,83,119,127,199,225],"occurrence":[77,120,200,226],"which":[79,122,165,267],"reports":[80,123],"pairs":[81],"in":[87,131,134,144,172,202,228,263],"such":[89],"that":[90,194,220],"their":[91],"gaps":[92],"(i.e.,":[93],"distances":[95],"between":[96],"them)":[97],"lie":[98],"within":[99],"query-specified":[101],"range":[102,162,197,223],"[g\u2081,":[103],"g\u2082].":[104],"Recently,":[105],"Bille":[106],"et":[107],"al.":[108],"[FSTTCS":[109],"2020,":[110],"2022]":[114],"proposed":[115],"top-k":[117,198],"close":[118],"k":[125],"closest":[126],"T,":[132],"sorted":[133],"non-decreasing":[135],"order":[136],"distance.":[138],"Both":[139],"problems":[140,159,258],"are":[141,182,268],"optimally":[142],"solved":[143],"query":[145,163,201,227],"time":[146],"O(n":[148,189,215],"log":[149,205,206,231,232],"n)-space":[150,191,217],"data":[151,192,218],"structures.":[152],"In":[153],"paper,":[155],"we":[156,253],"generalize":[157],"these":[158],"model,":[164],"focuses":[166],"only":[167],"on":[168],"specified":[174],"substring":[175],"T[a..":[176],"b]":[177],"Our":[180],"contributions":[181],"follows:":[184],"-":[185,211],"We":[186,212],"propose":[187,213],"an":[188,214],"log\u00b2":[190],"structure":[193,219],"answers":[195,221],"O(|P|":[203,229],"+":[204,208,230,234],"k)":[209],"time.":[210],"log^{2+\u03b5}":[216],"output)":[235],"time,":[236],"where":[237],"\u03b5":[238],"positive":[241],"constant":[242],"output":[244],"denotes":[245],"number":[247],"outputs.":[249],"Additionally,":[250],"by-products,":[252],"present":[254],"algorithms":[255],"geometric":[257],"involving":[259],"weighted":[260],"horizontal":[261],"segments":[262],"2D":[265],"plane,":[266],"independent":[270],"interest.":[271]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}