1 citations · 1 across the 3 of their papers we have counts for
5 papers · 1 filter
SOPanG 2: online searching over a pan-genome without false positives
Aleksander Cisłak, Szymon Grabowski
Motivation: The pan-genome can be stored as elastic-degenerate (ED) string, a recently introduced compact representation of multiple overlapping sequences. However, a search over t…
Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations
Aleksander Cisłak, Szymon Grabowski
We aim to speed up approximate keyword matching by storing a lightweight, fixed-size block of data for each string, called a fingerprint. These work in a similar way to hash values…
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,…
Full-text and Keyword Indexes for String Searching
Aleksander Cisłak
In this work, we present a literature review for full-text and keyword indexes as well as our contributions (which are mostly practice-oriented). The first contribution is the FM-b…
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…