16 citations · 17 across the 5 of their papers we have counts for
5 papers
Hierarchical Bitmap Indexing for Range and Membership Queries on Multidimensional Arrays
Luboš Krčál, Shen-Shyang Ho, Jan Holub
Traditional indexing techniques commonly employed in da\-ta\-ba\-se systems perform poorly on multidimensional array scientific data. Bitmap indices are widely used in commercial d…
PFP Data Structures
Christina Boucher, Ondřej Cvacho, Travis Gagie +4
Prefix-free parsing (PFP) was introduced by Boucher et al. (2019) as a preprocessing step to ease the computation of Burrows-Wheeler Transforms (BWTs) of genomic databases. Given a…
Data structures to represent a set of k-long DNA sequences
Rayan Chikhi, Jan Holub, Paul Medvedev
The analysis of biological sequencing data has been one of the biggest applications of string algorithms. The approaches used in many such applications are based on the analysis of…
Technology Beats Algorithms (in Exact String Matching)
Jorma Tarhio, Jan Holub, Emanuele Giaquinta
More than 120 algorithms have been developed for exact string matching within the last 40 years. We show by experiments that the \naive{} algorithm exploiting SIMD instructions of…
Suffix Tree of Alignment: An Efficient Index for Similar Data
Joong Chae Na, Heejin Park, Maxime Crochemore +4
We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings and is a compact…