8 citations · 12 across the 5 of their papers we have counts for
9 papers · 1 filter
Space-Efficient Huffman Codes Revisited
Szymon Grabowski, Dominik Köppl
Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gag…
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…
copMEM: Finding maximal exact matches via sampling both genomes
Szymon Grabowski, Wojciech Bieniecki
Genome-to-genome comparisons require designating anchor points, which are given by Maximum Exact Matches (MEMs) between their sequences. For large genomes this is a challenging pro…
On Abelian Longest Common Factor with and without RLE
Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski
We consider the Abelian longest common factor problem in two scenarios: when input strings are uncompressed and are of size , and when the input strings are run-length encoded a…
Faster range minimum queries
Tomasz Kowalski, Szymon Grabowski
Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, w…
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…