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...
share
research
∙
09/24/2020
Dynamic Similarity Search on Integer Sketches
Similarity-preserving hashing is a core technique for fast similarity se...
research
∙
06/09/2020
Optimal-Time Queries on BWT-runs Compressed Indexes
Although a significant number of compressed indexes for highly repetitiv...
research
∙
06/09/2020
Faster Queries on BWT-runs Compressed Indexes
Although a significant number of compressed indexes for highly repetitiv...
research
∙
05/21/2020
Succinct Trit-array Trie for Scalable Trajectory Similarity Search
Massive datasets of spatial trajectories representing the mobility of a ...
research
∙
04/03/2020
Enumeration of LCP values, LCP intervals and Maximal repeats in BWT-runs Bounded Space
Lcp-values, lcp-intervals, and maximal repeats are powerful tools in var...
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
∙
05/06/2019
Statistically Discriminative Sub-trajectory Mining
We study the problem of discriminative sub-trajectory mining. Given two ...
research
∙
02/14/2019
Conversion from RLBWT to LZ77
Converting a compressed format of a string into another compressed forma...
research
∙
01/07/2019
Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint
Here, we present a novel algorithm for frequent itemset mining for strea...
research
∙
12/11/2018
LZRR: LZ77 Parsing with Right Reference
Lossless data compression has been widely studied in computer science. O...
research
∙
02/18/2018
Scalable Alignment Kernels via Space-Efficient Feature Maps
String kernels are attractive data analysis tools for analyzing string d...
research
∙
11/08/2017
