{"id":"https://openalex.org/W7140211964","doi":"https://doi.org/10.48550/arxiv.2603.22147","title":"Optimal-Time Move Structure Construction","display_name":"Optimal-Time Move Structure Construction","publication_year":2026,"publication_date":"2026-03-23","ids":{"openalex":"https://openalex.org/W7140211964","doi":"https://doi.org/10.48550/arxiv.2603.22147"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.22147","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.22147","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.22147","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Brown, Nathaniel K.","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brown, Nathaniel K.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sanaullah, Ahsan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanaullah, Ahsan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Zhang, Shaojie","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Shaojie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Langmead, Ben","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Langmead, Ben","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"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.9919000267982483,"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.9919000267982483,"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.002300000051036477,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6044999957084656},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5978000164031982},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.592199981212616},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5378999710083008},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5252000093460083},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.48330000042915344},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4810999929904938},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4205000102519989}],"concepts":[{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6044999957084656},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5978000164031982},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.592199981212616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5819000005722046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5569000244140625},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5378999710083008},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5252000093460083},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48330000042915344},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4810999929904938},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4205000102519989},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41440001130104065},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4115000069141388},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.39010000228881836},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33629998564720154},{"id":"https://openalex.org/C146064661","wikidata":"https://www.wikidata.org/wiki/Q186152","display_name":"Array data structure","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.3019999861717224},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.2711000144481659},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.22147","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.22147","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":"doi:10.48550/arxiv.2603.22147","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.22147","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,46,93],"move":[1,47,97,155],"structure":[2,48,98,156],"represents":[3],"a":[4,10,109,126],"permutation":[5],"$\u03c0$":[6],"of":[7,13,19,27,52,57,69,133],"$[0,n)$":[8],"as":[9],"covering":[11],"set":[12],"$O(r)$":[14,50],"disjoint":[15],"intervals":[16,28],"(contiguous":[17],"subsets":[18],"$[0,n)$),":[20],"where":[21,79],"$r$":[22],"is":[23,163],"the":[24,55,58,67,70,131,134,146,166],"minimum":[25],"number":[26],"whose":[29],"values":[30],"permute":[31],"together.":[32],"Formally,":[33],"$r":[34,80],"=":[35],"1":[36,43],"+":[37],"|\\{i\\in":[38],"[1,n)":[39],":":[40],"\u03c0(i)":[41],"-":[42],"\\neq":[44],"\u03c0(i-1)\\}|$.":[45],"takes":[49,101],"words":[51],"space.":[53,92,116],"Given":[54],"index":[56,68],"interval":[59,71],"containing":[60,72],"$i$,":[61],"it":[62,83,162],"allows":[63,84,130],"computing":[64],"$\u03c0(i)$":[65,73],"and":[66,87,115,142,159],"in":[74,89,139],"$O(1)$-time.":[75],"Therefore,":[76],"for":[77],"permutations":[78],"\\ll":[81],"n$,":[82],"their":[85],"representation":[86],"navigation":[88],"significantly":[90],"compressed":[91],"previous":[94,128,167],"best":[95,168],"$O(r)$-space":[96],"construction":[99,110,157],"algorithm":[100,111,124,158,169],"$O(r\\log":[102],"r)$-time.":[103],"In":[104],"this":[105],"paper,":[106],"we":[107,151],"describe":[108],"achieving":[112],"optimal":[113,143],"$O(r)$-time":[114],"We":[117],"also":[118],"show":[119],"that":[120,161],"using":[121,171],"our":[122,153],"improved":[123,154],"within":[125],"recent":[127],"work":[129],"computation":[132],"longest":[135],"common":[136],"prefix":[137],"array":[138],"$O(r)$-working":[140],"space":[141],"$O(n)$-time":[144],"given":[145],"run-length-encoded":[147],"Burrows-Wheeler":[148],"transform.":[149],"Finally,":[150],"implement":[152],"find":[160],"faster":[164],"than":[165],"while":[170],"comparable":[172],"memory.":[173]},"counts_by_year":[],"updated_date":"2026-04-28T06:04:28.489925","created_date":"2026-03-25T00:00:00"}