English

MIOV: Reordering MOVI for even better locality

Data Structures and Algorithms 2024-07-30 v1

Abstract

We consider how to reorder the rows of Nishimoto and Tabei's move structure such that we more often move from one row to the next in memory.

Keywords

Cite

@article{arxiv.2407.18956,
  title  = {MIOV: Reordering MOVI for even better locality},
  author = {Peter Perešíni and Nathaniel K. Brown and Travis Gagie and Ben Langmead},
  journal= {arXiv preprint arXiv:2407.18956},
  year   = {2024}
}