2 |
A theoretical and experimental analysis of BWT variants for string collections ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
String Rearrangement Inequalities and a Total Order Between Primitive Words ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
|
|
|
|
Abstract:
The suffix array $SA[1..n]$ of a text $T$ of length $n$ is a permutation of $\{1,\ldots,n\}$ describing the lexicographical ordering of suffixes of $T$, and it is considered to be among of the most important data structures in string algorithms, with dozens of applications in data compression, bioinformatics, and information retrieval. One of the biggest drawbacks of the suffix array is that it is very difficult to maintain under text updates: even a single character substitution can completely change the contents of the suffix array. Thus, the suffix array of a dynamic text is modelled using suffix array queries, which return the value $SA[i]$ given any $i\in[1..n]$. Prior to this work, the fastest dynamic suffix array implementations were by Amir and Boneh. At ISAAC 2020, they showed how to answer suffix array queries in $\tilde{O}(k)$ time, where $k\in[1..n]$ is a trade-off parameter, with $\tilde{O}(\frac{n}{k})$-time text updates. In a very recent preprint [2021], they also provided a solution with ... : 83 pages ...
|
|
Keyword:
Data Structures and Algorithms cs.DS; FOS Computer and information sciences
|
|
URL: https://arxiv.org/abs/2201.01285 https://dx.doi.org/10.48550/arxiv.2201.01285
|
|
BASE
|
|
Hide details
|
|
5 |
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Reduction ratio of the IS-algorithm: worst and random cases ...
|
|
|
|
BASE
|
|
Show details
|
|
11 |
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances ...
|
|
|
|
BASE
|
|
Show details
|
|
13 |
A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals ...
|
|
|
|
BASE
|
|
Show details
|
|
15 |
Lexicographically Fair Learning: Algorithms and Generalization ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time ...
|
|
|
|
BASE
|
|
Show details
|
|
18 |
The Labeled Direct Product Optimally Solves String Problems on Graphs ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|