research
∙
02/13/2023
Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings
We give an Õ(n^2) time algorithm for computing the exact Dynamic Time Wa...
share
research
∙
07/04/2022
Optimal Vertex-Cut Sparsification of Quasi-Bipartite Graphs
In vertex-cut sparsification, given a graph G=(V,E) with a terminal set ...
research
∙
12/23/2021
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time
The Suffix Array SA_S[1… n] of an n-length string S is a lexicographical...
research
∙
06/13/2021
The k-mappability problem revisited
The k-mappability problem has two integers parameters m and k. For every...
research
∙
07/13/2020
Update Query Time Trade-off for dynamic Suffix Arrays
The Suffix Array SA(S) of a string S[1 ... n] is an array containing all...
research
∙
06/24/2019
