Dec 31, 2020 · We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the ...

Nov 30, 2018 · We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular ...

We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular ...

We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular ...

We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular ...

We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular ...

We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular ...

We describe the first self-indexes able to count and locate pattern occurrences in optimal time within a space bounded by the size of the most popular ...

In this paper, we present OptBWTR (optimal-time queries on BWT-runs compressed indexes), the first string index that supports various queries including locate,.

The main advatages are: optimality, easier to predict symbols, slight improvement in decompression speed. The disadvantages are clear: have to add the ...