{"id":"https://openalex.org/W7163905128","doi":"https://doi.org/10.4230/lipics.cpm.2026.22","title":"Optimal-Time Mapping in Run-Length Compressed PBWT","display_name":"Optimal-Time Mapping in Run-Length Compressed PBWT","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163905128","doi":"https://doi.org/10.4230/lipics.cpm.2026.22"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25948","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.22","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.22/LIPIcs.CPM.2026.22.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.22/LIPIcs.CPM.2026.22.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138183472","display_name":"Paola Bonizzoni","orcid":"https://orcid.org/0000-0001-7289-4988"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Bonizzoni, Paola","raw_affiliation_strings":["Department of Computer Science, University of Milano-Bicocca, Italy"],"raw_orcid":"https://orcid.org/0000-0001-7289-4988","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Milano-Bicocca, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021585705","display_name":"Davide Cozzi","orcid":"https://orcid.org/0000-0003-2439-0608"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Cozzi, Davide","raw_affiliation_strings":["Department of Computer Science, University of Milano-Bicocca, Italy"],"raw_orcid":"https://orcid.org/0000-0003-2439-0608","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Milano-Bicocca, Italy","institution_ids":["https://openalex.org/I66752286"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071941755","display_name":"Younan Gao","orcid":"https://orcid.org/0000-0003-4984-2551"},"institutions":[{"id":"https://openalex.org/I66752286","display_name":"University of Milano-Bicocca","ror":"https://ror.org/01ynf4891","country_code":"IT","type":"education","lineage":["https://openalex.org/I66752286"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gao, Younan","raw_affiliation_strings":["Department of Computer Science, University of Milano-Bicocca, Italy"],"raw_orcid":"https://orcid.org/0000-0003-4984-2551","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Milano-Bicocca, Italy","institution_ids":["https://openalex.org/I66752286"]}]}],"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.92610397,"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/T10261","display_name":"Genetic Associations and Epidemiology","score":0.48570001125335693,"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"}},"topics":[{"id":"https://openalex.org/T10261","display_name":"Genetic Associations and Epidemiology","score":0.48570001125335693,"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/T11269","display_name":"Algorithms and Data Compression","score":0.26980000734329224,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.06939999759197235,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.6858000159263611},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6820999979972839},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4546000063419342},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45170000195503235},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4146000146865845},{"id":"https://openalex.org/keywords/haplotype","display_name":"Haplotype","score":0.40220001339912415},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.3910999894142151},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.3749000132083893}],"concepts":[{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.6858000159263611},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6820999979972839},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5508000254631042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4708000123500824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46140000224113464},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45170000195503235},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4146000146865845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41019999980926514},{"id":"https://openalex.org/C197754878","wikidata":"https://www.wikidata.org/wiki/Q80711","display_name":"Haplotype","level":4,"score":0.40220001339912415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39719998836517334},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3910999894142151},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31769999861717224},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.30880001187324524},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.26260000467300415},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.25130000710487366},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25948","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.22","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.22/LIPIcs.CPM.2026.22.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.22","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cpm.2026.22","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:25948","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2026.22","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol369-cpm2026/LIPIcs.CPM.2026.22/LIPIcs.CPM.2026.22.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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163905128.pdf","grobid_xml":"https://content.openalex.org/works/W7163905128.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"Positional":[1],"Burrows-Wheeler":[2],"Transform":[3],"(PBWT)":[4],"is":[5,78,112],"a":[6,120,139,146],"data":[7,85,142,190,212],"structure":[8,86,143,191,213],"designed":[9],"for":[10,53],"efficiently":[11],"representing":[12],"and":[13,26,34,56,90,136,162,174,236],"querying":[14],"large":[15],"collections":[16],"of":[17,64,82,148,155,230,241],"sequences,":[18],"such":[19],"as":[20,69],"haplotype":[21,54,172,194],"panels":[22],"in":[23,36,93,196,217],"genomics.":[24],"Forward":[25],"backward":[27,91,163],"stepping":[28,92,182],"operations":[29],"-":[30,40,171,177],"analogues":[31],"to":[32,43,119],"LF-":[33],"FL-mapping":[35],"the":[37,44,51,60,65,70,79,108,133,228,231,239,244],"traditional":[38],"BWT":[39],"are":[41],"fundamental":[42],"PBWT,":[45],"underpinning":[46],"many":[47],"algorithms":[48],"based":[49],"on":[50,132],"PBWT":[52,66,110],"matching":[55],"related":[57],"analyses.":[58],"Although":[59],"run-length":[61],"encoded":[62],"variant":[63],"(also":[67],"known":[68],"\u03bc-PBWT)":[71],"achieves":[72],"O(r\u0303)-word":[73,141,188],"space":[74,98,189],"usage,":[75],"where":[76,225],"r\u0303":[77,135],"total":[80],"number":[81,240],"runs,":[83],"no":[84],"supporting":[87],"both":[88],"forward":[89,161,181],"constant":[94],"time":[95],"within":[96],"this":[97,104],"bound":[99],"was":[100],"previously":[101],"known.":[102],"In":[103],"paper,":[105],"we":[106,185,206],"consider":[107],"multi-allelic":[109],"that":[111,158,192,214],"extended":[113],"from":[114],"its":[115],"original":[116],"binary":[117],"form":[118],"general":[121],"ordered":[122],"alphabet":[123],"{0,":[124],"\u2026":[125,151],",":[126,152],"\u03c3-1}.":[127],"We":[128,165],"first":[129],"establish":[130],"bounds":[131],"size":[134],"then":[137],"introduce":[138],"new":[140],"built":[144],"over":[145],"list":[147],"haplotypes":[149,242],"{S_1,":[150],"S_h},":[153],"each":[154],"length":[156,229],"w,":[157],"supports":[159,193],"constant-time":[160],"stepping.":[164],"further":[166],"revisit":[167],"two":[168],"key":[169],"applications":[170],"retrieval":[173,195],"prefix":[175,204,234],"search":[176],"leveraging":[178],"our":[179],"efficient":[180],"technique.":[183],"Specifically,":[184],"design":[186],"an":[187,208],"O(log":[197],"log_w":[198,220],"h":[199],"+":[200,210,222],"w)":[201],"time.":[202],"For":[203],"search,":[205],"present":[207],"O(h":[209],"r\u0303)-word":[211],"answers":[215],"queries":[216],"O(m'":[218],"log":[219],"\u03c3":[221],"occ)":[223],"time,":[224],"m'":[226],"denotes":[227,238],"longest":[232,245],"common":[233],"returned":[235],"occ":[237],"prefixed":[243],"prefix.":[246]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}