2026-07-22T09:18:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:20366 2024-07-11T07:11:31Z ddc:004 open_access

Move-r: Optimizing the r-index Bertram, Nico Fischer, Johannes Nalbach, Lukas Compressed Text Index Burrows-Wheeler Transform We present a static text index called Move-r, which is a highly optimized version of the r-index ([Travis Gagie et al., 2020] Gagie et al., 2020) that encorporates recent theoretical developments of the move data structure ([Takaaki Nishimoto and Yasuo Tabei, 2021] Nishimoto and Tabei, 2021). The r-index is the method of choice for indexing highly repetitive texts, such as different versions of a text document or DNA from the same species, as it exploits the compressibilty of the underlying data. With Move-r, we can answer count- and locate queries 2-35 (typically 15) times as fast as with any other r-index supporting locate queries while being 0.8-2.5 (typically 2) times as large. A Move-r index can be constructed 0.9-2 (typically 2) times as fast while using 1/3-1 (typically 1/2) times as much space. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nico Bertram and Johannes Fischer and Lukas Nalbach 2024 Is Part Of LIPIcs, Volume 301, 22nd International Symposium on Experimental Algorithms (SEA 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SEA.2024.1 urn:nbn:de:0030-drops-203662 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.1 eng https://creativecommons.org/licenses/by/4.0/legalcode