{"id":"https://openalex.org/W7223975641","doi":"https://doi.org/10.5445/ir/1000198477","title":"String Matching in (Block) Graphs: A Full Classification by Walk Length","display_name":"String Matching in (Block) Graphs: A Full Classification by Walk Length","publication_year":2026,"publication_date":"2026-10-27","ids":{"openalex":"https://openalex.org/W7223975641","doi":"https://doi.org/10.5445/ir/1000198477"},"language":"en","primary_location":{"id":"doi:10.5445/ir/1000198477","doi":"https://doi.org/10.5445/ir/1000198477","is_oa":true,"landing_page_url":"https://doi.org/10.5445/ir/1000198477","pdf_url":null,"source":{"id":"https://openalex.org/S7407052948","display_name":"KITopen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"volume":null,"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5445/ir/1000198477","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128703403","display_name":"Sebastian Angrick","orcid":"https://orcid.org/0009-0007-9840-9611","observed_orcids":["https://orcid.org/0009-0007-9840-9611"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Angrick, Sebastian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053507894","display_name":"Ben Bals","orcid":"https://orcid.org/0009-0009-1054-8444","observed_orcids":["https://orcid.org/0009-0009-1054-8444"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bals, Ben","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022706035","display_name":"Pawe\u0142 Gawrychowski","orcid":"https://orcid.org/0000-0002-6993-5440","observed_orcids":["https://orcid.org/0000-0002-6993-5440"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gawrychowski, Pawe\u0142","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051275317","display_name":"Solon P. Pissis","orcid":"https://orcid.org/0000-0002-1445-1932","observed_orcids":["https://orcid.org/0000-0002-1445-1932"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pissis, Solon P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092491477","display_name":"Yuki Yonemoto","orcid":"https://orcid.org/0009-0008-5330-7256","observed_orcids":["https://orcid.org/0009-0008-5330-7256"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yonemoto, Yuki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083100766","display_name":"Philip Bille","orcid":"https://orcid.org/0000-0002-1120-5154","observed_orcids":["https://orcid.org/0000-0002-1120-5154"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bille, Philip","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904","observed_orcids":["https://orcid.org/0000-0002-0495-3904"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pettie, Seth","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027517542","display_name":"Sabine Storandt","orcid":"https://orcid.org/0000-0001-5411-3834","observed_orcids":["https://orcid.org/0000-0001-5411-3834"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Storandt, Sabine","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.85632953,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.9980000257492065,"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.9980000257492065,"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.0006000000284984708,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.00039999998989515007,"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/fine-grained-complexity","display_name":"fine-grained complexity","score":0.6200000047683716},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"parameterized complexity","score":0.5879999995231628},{"id":"https://openalex.org/keywords/nearly-linear-time-algorithms","display_name":"near-linear time algorithms","score":0.6449999809265137},{"id":"https://openalex.org/keywords/matrix-multiplication-exponent","display_name":"matrix multiplication exponent","score":0.6460000276565552},{"id":"https://openalex.org/keywords/conditional-lower-bounds","display_name":"conditional lower bounds","score":0.40700000524520874}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7498999834060669},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6549999713897705},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5730000138282776},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5508999824523926},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.524399995803833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4934000074863434},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47130000591278076},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3869999945163727},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.33489999175071716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3255000114440918},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.29910001158714294},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.2538999915122986},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5445/ir/1000198477","doi":"https://doi.org/10.5445/ir/1000198477","is_oa":true,"landing_page_url":"https://doi.org/10.5445/ir/1000198477","pdf_url":null,"source":{"id":"https://openalex.org/S7407052948","display_name":"KITopen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.5445/ir/1000198477","doi":"https://doi.org/10.5445/ir/1000198477","is_oa":true,"landing_page_url":"https://doi.org/10.5445/ir/1000198477","pdf_url":null,"source":{"id":"https://openalex.org/S7407052948","display_name":"KITopen","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I102335020","host_organization_name":"Karlsruhe Institute of Technology","host_organization_lineage":["https://openalex.org/I102335020"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7011197035","https://openalex.org/W4311727100","https://openalex.org/W6929241299","https://openalex.org/W4413071363","https://openalex.org/W2910267792","https://openalex.org/W4327590906","https://openalex.org/W4407785964","https://openalex.org/W6995655542","https://openalex.org/W4388482447","https://openalex.org/W4312791883"],"abstract_inverted_index":{"We":[0,70,188,223,256],"consider":[1],"directed":[2,157],"graphs":[3,29,335],"in":[4,14,33,88,173,178,184,319,387,399],"which":[5,149,330],"the":[6,21,24,68,73,97,125,144,179,185,191,208,232,277,326,390,400],"nodes":[7,162],"are":[8,30,375],"labeled":[9],"with":[10,336],"strings.":[11],"A":[12],"walk":[13,60,127,145,172],"such":[15,45,397],"a":[16,46,52,59,156,171,225,249,258,271,367],"graph":[17,47,158,175],"naturally":[18,150],"corresponds":[19],"to":[20,35,137,147,152,377,384],"concatenation":[22],"of":[23,40,54,67,100,129,161,211,234,274,285,366,402],"visited":[25],"nodes'":[26],"labels.":[27,103],"These":[28],"widely":[31],"used":[32],"bioinformatics":[34],"compactly":[36],"describe":[37],"large":[38],"collections":[39],"highly":[41],"similar":[42],"genomes.":[43],"Given":[44],"G":[48],"=":[49,242,268,354],"(V,E)":[50],"and":[51,182,309,357],"pattern":[53],"length":[55,99,130,146,286],"m,":[56],"we":[57,133,169,202,370],"seek":[58,170],"whose":[61,159],"corresponding":[62],"string":[63],"has":[64],"an":[65,316,394],"occurrence":[66],"pattern.":[69],"call":[71,189],"this":[72,113,139,174,190,275],"SMLG":[74,84,278,391],"problem.":[75,193],"Amir":[76,212],"et":[77,105,195,213],"al.":[78,106,196,214],"[J.":[79],"Algorithms,":[80,109],"2000]":[81],"showed":[82,111,199],"that":[83,112,124,176,229,372],"can":[85],"be":[86,135],"solved":[87],"\ud835\udcaa(m":[89,251],"|E|":[90,262],"+":[91,252,261,263,300,347],"N)":[92],"time,":[93,322],"where":[94,323,389],"N":[95],"is":[96,114,128,163,215,296,315,325,331,364,393],"total":[98],"all":[101],"node":[102],"Equi":[104,194],"[ACM":[107],"Trans.":[108],"2023]":[110,198],"essentially":[115,216,230],"optimal":[116,217,333],"(under":[117],"SETH).":[118,222],"The":[119],"existing":[120,209],"lower":[121,140],"bound":[122,141],"assumes":[123],"sought":[126],"\u0398(|V|).":[131],"Thus,":[132],"might":[134],"able":[136],"bypass":[138],"by":[142,237],"restricting":[143],"b-1,":[148],"reduces":[151],"having":[153],"as":[154,398],"input":[155],"set":[160],"partitioned":[164],"into":[165],"b":[166,241,267,281,306,337,353],"blocks.":[167,340],"Then,":[168],"starts":[177],"first":[180],"block":[181],"ends":[183],"last":[186],"block.":[187],"b-SMBG":[192,219,235],"[Algorithmica,":[197],"that,":[200],"if":[201],"impose":[203],"no":[204,297,344],"restriction":[205],"on":[206],"b,":[207],"algorithm":[210,265,317,349],"for":[218,266,280,304,334,351],"(again":[220],"under":[221],"provide":[224],"more":[226],"fine-grained":[227],"classification":[228],"settles":[231],"complexity":[233],"parameterized":[236],"b:":[238],"1)":[239],"For":[240],"2,":[243],"Pissis":[244],"[SOSA":[245],"2025]":[246],"already":[247],"provided":[248],"simple":[250,376],"|E|+N)-time":[253],"algorithm.":[254],"2)":[255,289],"design":[257],"new":[259],"\ud835\udcaa\u0303(m":[260],"N)-time":[264,301,348],"3.":[269],"As":[270,379],"direct":[272],"implication":[273],"result,":[276],"problem":[279,392],"\u2264":[282],"3":[283],"(walks":[284],"at":[287],"most":[288],"also":[290],"admits":[291],"near-linear-time":[292],"complexity.":[293],"3)":[294],"There":[295,314],"\ud835\udcaa((m":[298,345],"|E|)^{1-\u03b5}":[299,346],"combinatorial":[302],"algorithm,":[303],"any":[305,352],"\u2265":[307,338],"4":[308,339],"\u03b5":[310,358],">":[311,359],"0.":[312,360],"4)":[313],"working":[318],"\ud835\udcaa(max(|V|,":[320],"m)^\u03c9+N)":[321],"\u03c9":[324],"matrix":[327],"multiplication":[328],"exponent,":[329],"conditionally":[332],"5)":[341],"Under":[342],"SETH,":[343],"exists,":[350],"\u03c9(log":[355],"|V|)":[356],"Although":[361],"our":[362,373],"motivation":[363],"primarily":[365],"theoretical":[368],"nature,":[369],"stress":[371],"algorithms":[374],"implement.":[378],"such,":[380],"they":[381],"may":[382],"contribute":[383],"practical":[385],"advancements":[386],"applications":[388],"important":[395],"primitive,":[396],"analysis":[401],"pangenome":[403],"graphs.":[404]},"counts_by_year":[],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2026-10-28T00:00:00"}