{"id":"https://openalex.org/W4415331477","doi":"https://doi.org/10.4230/lipics.cpm.2026.3","title":"Computing k-mers in Graphs","display_name":"Computing k-mers in Graphs","publication_year":2025,"publication_date":"2025-09-26","ids":{"openalex":"https://openalex.org/W4415331477","doi":"https://doi.org/10.4230/lipics.cpm.2026.3"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.22885","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.22885","pdf_url":"https://arxiv.org/pdf/2509.22885","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.22885","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067903348","display_name":"Jarno Alanko","orcid":"https://orcid.org/0000-0002-8003-9225"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alanko, Jarno N.","raw_affiliation_strings":["Department of Computer Science, University of Helsinki, Finland"],"raw_orcid":"https://orcid.org/0000-0002-8003-9225","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Helsinki, Finland","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120056367","display_name":"Maximo Perez-Lopez","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P\u00e9rez-L\u00f3pez, M\u00e1ximo","raw_affiliation_strings":["Department of Computer Science, Technical University of Denmark, Lyngby, Denmark"],"raw_orcid":"https://orcid.org/0009-0001-8507-4820","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Denmark, Lyngby, Denmark","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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.24878318,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9797000288963318,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9797000288963318,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9790999889373779,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.963100016117096,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.7771999835968018},{"id":"https://openalex.org/keywords/de-bruijn-graph","display_name":"De Bruijn graph","score":0.5285000205039978},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48080000281333923},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.33070001006126404},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.3091000020503998},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.30630001425743103}],"concepts":[{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.7771999835968018},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.603600025177002},{"id":"https://openalex.org/C20218877","wikidata":"https://www.wikidata.org/wiki/Q3066095","display_name":"De Bruijn graph","level":3,"score":0.5285000205039978},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5157999992370605},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4950999915599823},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48080000281333923},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.33070001006126404},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.3091000020503998},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.30630001425743103},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.2994000017642975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2809000015258789},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26010000705718994},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25290000438690186}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2509.22885","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.22885","pdf_url":"https://arxiv.org/pdf/2509.22885","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:25929","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.3","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.3/LIPIcs.CPM.2026.3.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":"pmh:doi:10.48550/arxiv.2509.22885","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2509.22885","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.22885","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"article"},{"id":"doi:10.4230/lipics.cpm.2026.3","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.3","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:arXiv.org:2509.22885","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.22885","pdf_url":"https://arxiv.org/pdf/2509.22885","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,38,188],"initiate":[1],"the":[2,22,26,33,51,98,129,144,149,171,177,183,186,195,201,209,238],"study":[3],"of":[4,10,24,28,35,53,68,97,100,134,143,148,166,173,185],"computational":[5],"problems":[6],"on":[7,32,45],"$k$-mers":[8,30,67,150],"(strings":[9],"length":[11],"$k$)":[12],"in":[13,50,124,176,194,237],"labeled":[14],"graphs.":[15,105],"As":[16,131],"a":[17,36,70,94,118,121,125,141,218],"starting":[18],"point,":[19],"we":[20,63,113,139],"consider":[21],"problem":[23],"counting":[25,137],"number":[27,172],"distinct":[29,66,174],"found":[31],"walks":[34],"graph.":[37,239],"establish":[39],"that":[40,65,127,151,200],"this":[41,216],"is":[42,170,182],"$\\#$P-hard,":[43],"even":[44],"connected":[46],"deterministic":[47,54],"DAGs.":[48],"However,":[49],"class":[52],"Wheeler":[55,104,111,122,178,202],"graphs":[56],"(Gagie,":[57],"Manzini,":[58],"and":[59,88,180],"Sir\u00e8n,":[60],"TCS":[61],"2017),":[62],"show":[64,189],"such":[69],"graph":[71,119,123,147,203,225],"$W=(V,":[72],"E)$":[73],"can":[74,204],"be":[75,205],"counted":[76],"using":[77],"$O(|W|k)$":[78],"or":[79],"$O(n^4":[80],"\\log":[81],"k)$":[82],"arithmetic":[83],"operations,":[84],"where":[85,168],"$n=|V|$,":[86],"$m=|E|$":[87],"$|W|=n+m$.":[89],"The":[90],"latter":[91],"result":[92],"uses":[93],"new":[95],"generalization":[96],"technique":[99],"prefix":[101],"doubling":[102],"to":[103,116,191],"To":[106],"generalize":[107],"our":[108,135],"results":[109],"beyond":[110],"graphs,":[112,229],"discuss":[114],"ways":[115],"transform":[117],"into":[120],"manner":[126],"preserves":[128],"$k$-mers.":[130],"an":[132],"application":[133],"$k$-mer":[136,236],"algorithms,":[138],"construct":[140,192],"representation":[142],"de":[145,210,223],"Bruijn":[146,211,224],"occupies":[152],"$O(n_k":[153],"+":[154,162],"|W|k":[155],"\\log(\\max_{1":[156],"\\leq":[157,159],"\\ell":[158],"k}":[160],"n_\\ell)":[161],"\u03c3\\log":[163],"m)$":[164],"bits":[165],"space,":[167],"$n_\\ell$":[169],"$\\ell$-mers":[175],"graph,":[179,212],"$\u03c3$":[181],"size":[184],"alphabet.":[187],"how":[190],"it":[193],"same":[196],"time":[197,234],"complexity.":[198],"Given":[199],"exponentially":[206],"smaller":[207],"than":[208],"for":[213],"large":[214],"$k$":[215],"provides":[217],"theoretical":[219],"improvement":[220],"over":[221],"previous":[222],"construction":[226],"methods":[227],"from":[228],"which":[230],"must":[231],"spend":[232],"$\u03a9(k)$":[233],"per":[235]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-19T00:00:00"}