308 citations · 462 across the 24 of their papers we have counts for
6 papers · 1 filter
A bloated FM-index reducing the number of cache misses during the search
Szymon Grabowski, Aleksander Cisłak
The FM-index is a well-known compressed full-text index, based on the Burrows-Wheeler transform (BWT). During a pattern search, the BWT sequence is accessed at "random" locations,…
A Bloom filter based semi-index on -grams
Szymon Grabowski, Robert Susik, Marcin Raniszewski
We present a simple -gram based semi-index, which allows to look for a pattern typically only in a small fraction of text blocks. Several space-time tradeoffs are presented. Exp…
FM-index for dummies
Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz
The FM-index is a celebrated compressed data structure for full-text pattern searching. After the first wave of interest in its theoretical developments, we can observe a surge of…
A note on the longest common Abelian factor problem
Szymon Grabowski
Abelian string matching problems are becoming an object of considerable interest in last years. Very recently, Alatabbi et al. \cite{AILR2015} presented the first solution for the…
Indexing arbitrary-length -mers in sequencing reads
Tomasz Kowalski, Szymon Grabowski, Sebastian Deorowicz
We propose a lightweight data structure for indexing and querying collections of NGS reads data in main memory. The data structure supports the interface proposed in the pioneering…
A practical index for approximate dictionary matching with few mismatches
Aleksander Cisłak, Szymon Grabowski
Approximate dictionary matching is a classic string matching problem (checking if a query string occurs in a collection of strings) with applications in, e.g., spellchecking, onlin…