{"id":"https://openalex.org/W7128717307","doi":"https://doi.org/10.48550/arxiv.2602.11029","title":"Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations","display_name":"Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations","publication_year":2026,"publication_date":"2026-02-11","ids":{"openalex":"https://openalex.org/W7128717307","doi":"https://doi.org/10.48550/arxiv.2602.11029"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.11029","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125762843","display_name":"Nathaniel K. Brown","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brown, Nathaniel K.","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047760215","display_name":"Ben Langmead","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Langmead, Ben","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5125762843"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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.9921000003814697,"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.9921000003814697,"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.00430000014603138,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.00039999998989515007,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.539900004863739},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5112000107765198},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4799000024795532},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.47350001335144043},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.42239999771118164},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.4050999879837036},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.3714999854564667},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.35600000619888306},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.35269999504089355},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.3452000021934509}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5719000101089478},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.539900004863739},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5112000107765198},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4799000024795532},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.47350001335144043},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4456000030040741},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43689998984336853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4309999942779541},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.42239999771118164},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.4050999879837036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38119998574256897},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3546000123023987},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3452000021934509},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.3314000070095062},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C1893757","wikidata":"https://www.wikidata.org/wiki/Q3653001","display_name":"Inversion (geology)","level":3,"score":0.27900001406669617},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.26980000734329224},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.26089999079704285},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.11029","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.11029","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.11029","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.11029","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"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":{"The":[0,182],"move":[1,106,157,240],"structure":[2,107,158,241],"represents":[3],"permutations":[4,210],"with":[5,13,159,264,275],"long":[6,101],"contiguously":[7],"permuted":[8],"intervals":[9],"in":[10,40,44,63,151,228,273],"compressed":[11,24],"space":[12,28,271],"optimal":[14,111],"query":[15,61,108,126,185],"time.":[16],"They":[17],"have":[18],"become":[19],"an":[20,91,140],"important":[21],"feature":[22],"of":[23,33,81,95,134],"text":[25],"indexes":[26],"using":[27,70],"proportional":[29],"to":[30,48,110,173,190,205,216,246],"the":[31,71,77,82,104,119,175,203,236],"number":[32],"Burrows-Wheeler":[34],"Transform":[35],"(BWT)":[36],"runs,":[37],"often":[38],"applied":[39],"genomics.":[41],"This":[42,65,122],"is":[43,66,187,256],"thanks":[45],"not":[46],"only":[47],"theoretical":[49],"improvements":[50],"over":[51,130,162],"past":[52],"approaches,":[53],"but":[54],"great":[55],"cache":[56],"efficiency":[57],"and":[58,153,197,214,223,243,258],"average":[59,105],"case":[60,73,184],"time":[62,109,117,127,186],"practice.":[64,154],"true":[67],"even":[68,92],"without":[69,193],"worst":[72,183],"guarantees":[74],"provided":[75],"by":[76,99,178],"interval":[78],"splitting":[79,249],"balancing":[80],"original":[83],"result.":[84],"In":[85],"this":[86],"paper,":[87],"we":[88,166,234],"show":[89],"that":[90],"simpler":[93],"type":[94],"splitting,":[96],"length":[97,253],"capping":[98,254],"truncating":[100],"intervals,":[102],"bounds":[103],"whilst":[112],"obtaining":[113],"a":[114,131,135,145,156,163,270,278],"superior":[115],"construction":[116,199,255],"than":[118,262],"traditional":[120],"approach.":[121,250],"also":[123,188,268],"proves":[124],"constant":[125],"when":[128],"amortized":[129],"full":[132],"traversal":[133],"single":[136],"cycle":[137],"permutation":[138],"from":[139],"arbitrary":[141],"starting":[142],"position.":[143],"Such":[144],"scheme":[146],"has":[147],"surprising":[148],"benefits":[149],"both":[150],"theory":[152],"For":[155],"$r$":[160],"runs":[161],"domain":[164],"$n$,":[165],"replace":[167],"all":[168],"$O(r":[169,179],"\\log":[170,180],"n)$-bit":[171],"components":[172],"reduce":[174],"overall":[176],"representation":[177],"r)$-bits.":[181],"improved":[189],"$O(\\log":[191],"\\frac{n}{r})$":[192],"balancing.":[194],"An":[195],"$O(r)$-time":[196],"$O(r)$-space":[198],"lets":[200],"us":[201],"apply":[202],"method":[204],"run-length":[206],"encoded":[207],"BWT":[208,221],"(RLBWT)":[209],"such":[211],"as":[212],"LF":[213,285],"$\u03d5$":[215],"obtain":[217],"optimal-time":[218],"algorithms":[219],"for":[220,239,284],"inversion":[222],"suffix":[224],"array":[225],"(SA)":[226],"enumeration":[227],"$O(r)$":[229],"additional":[230],"working":[231],"space.":[232],"Finally,":[233],"introduce":[235],"Orbit":[237],"library":[238],"support,":[242],"use":[244],"it":[245],"evaluate":[247],"our":[248],"Experiments":[251],"find":[252],"faster":[257,265],"uses":[259],"less":[260],"memory":[261],"balancing,":[263],"queries.":[266],"We":[267],"see":[269],"reduction":[272],"practice,":[274],"at":[276],"least":[277],"$\\sim":[279],"40\\%$":[280],"disk":[281],"size":[282],"decrease":[283],"across":[286],"large":[287],"repetitive":[288],"genomic":[289],"collections.":[290]},"counts_by_year":[],"updated_date":"2026-04-17T05:58:53.018234","created_date":"2026-02-13T00:00:00"}