3 citations · 6 across the 15 of their papers we have counts for
4 papers · 1 filter
Tree Edit Distance: Near-Linear-Time Approximate, Sublinear, and Dynamic
Bingbing Hu, Tomasz Kociumaka, Jakob Nogler +1
Tree edit distance (TED), the analog of string edit distance (ED) for hierarchical data, is the minimum number of node insertions, deletions, and substitutions transforming one lab…
Dynamic Time Warping in the Low-Distance Regime
Itai Boneh, Shay Golan, Tomasz Kociumaka
Dynamic Time Warping (DTW) is a classical similarity measure for strings and time series that allows local stretching. Given non-empty strings over an alphabet and a cost…
Cell-Probe Lower Bounds and Complexity-Preserving Reductions for Suffix Array Queries
Dominik Kempa, Tomasz Kociumaka
For a text of length over an alphabet of size , its suffix array lists the starting positions of the suffixes of in lexicographic order, and its inverse suffix array…
Constant-Time Inverse Suffix Array Queries in Compact Space and Sublinear-Time Construction of Suffix Array Indexes
Dominik Kempa, Tomasz Kociumaka
For a text with , its suffix array orders the suffix starting positions lexicographically, while its inverse suffix array maps each position to its suf…