research
∙
07/28/2022
Engineering faster double-array Aho-Corasick automata
Multiple pattern matching in strings is a fundamental problem in text pr...
share
research
∙
07/06/2022
Computing NP-hard Repetitiveness Measures via MAX-SAT
Repetitiveness measures reveal profound characteristics of datasets, and...
research
∙
02/16/2022
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space
The compression of highly repetitive strings (i.e., strings with many re...
research
∙
09/27/2020
Rank/Select Queries over Mutable Bitmaps
The problem of answering rank/select queries over a bitmap is of utmost ...
research
∙
09/24/2020
Dynamic Similarity Search on Integer Sketches
Similarity-preserving hashing is a core technique for fast similarity se...
research
∙
05/21/2020
Succinct Trit-array Trie for Scalable Trajectory Similarity Search
Massive datasets of spatial trajectories representing the mobility of a ...
research
∙
10/18/2019
b-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches
Recently, randomly mapping vectorial data to strings of discrete symbols...
research
∙
06/14/2019
Dynamic Path-Decomposed Tries
A keyword dictionary is an associative array whose keys are strings. Rec...
research
∙
04/16/2019
