Paper Info
Title
On Elias-Fano for Rank Queries in FM-Indexes**Funded in part by Academy of Finland grant 319454.
Abstract
We describe methods to support fast rank queries on the Burrows-Wheeler transform (BWT) string $S$ of an input string $T$ on alphabet $\Sigma$, in order to support pattern counting queries. Our starting point is an approach previously adopted by several authors, which is to represent $S$ as $\vert \Sigma\vert$ bitvectors, where the bitvector for symbol $c$ has a 1 at position $c$ if and only if $S...
Year
DOI
Venue
2021
10.1109/DCC50243.2021.00030
2021 Data Compression Conference (DCC)
Keywords
DocType
ISSN
Data compression,Transforms,Encoding,Standards
Conference
1068-0314
ISBN
Citations 
PageRank 
978-1-6654-0333-7
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Danyang Ma100.34
Simon J. Puglisi2113275.14
Rajeev Raman31550110.81
Bella Zhukova442.11