2026-06-05T17:52:56Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/175252026-02-03T12:21:41Zcom_10630_2254col_10630_37959

Boosting Backward Search Throughput for FM-Index Using a Compressed Encoding Herruzo-Ruiz, José Manuel González-Navarro, Sonia Ibáñez, Pablo Viñals, Victor Alastruey-Benedé, Jesús Plata-González, Óscar Guillermo ADN - Análisis secuencial The rapid development of DNA sequencing technologies has demanded for com- pressed data structures supporting fast pattern matching queries. FM-index is a widely-used compressed data structure that also supports fast pattern matching queries. It is common for the exact matching algorithm to be memory bound, resulting in poor performance. Searching several symbols in a single step improves data locality, although the memory bandwidth requirements remains the same. We propose a new data-layout of FM-index, called Split bit-vector, that compacts all data needed to search k symbols in a single step (k-step), reducing both memory movement and computing requirements at the cost of increasing memory footprint. 2019-04-11T11:31:35Z 2019-04-11T11:31:35Z 2019-04-11 2019-04-11 conference output https://hdl.handle.net/10630/17525 eng (DCC 2019) 2019 Data Compression Conference Snowbird, Utah, USA Marzo 26-29, 2019 open access