Szymon Grabowski

most citedA note on the longest common substring with

k

-mismatches problem

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2014★ 2 cited

A note on the longest common substring with $k$ -mismatches problem

Szymon Grabowski

The recently introduced longest common substring with $k$ -mismatches ( $k$ -LCF) problem is to find, given two sequences $S_{1}$ and $S_{2}$ of length $n$ each, a longest substring $A_{1}$ …

cs.DS2014

Sampling the suffix array with minimizers

Szymon Grabowski, Marcin Raniszewski

Sampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claude et al. showed an alphabet sampli…

cs.DS2014

Disk-based genome sequencing data compression

Szymon Grabowski, Sebastian Deorowicz, Łukasz Roguski

Motivation: High-coverage sequencing data have significant, yet hard to exploit, redundancy. Most FASTQ compressors cannot efficiently compress the DNA stream of large datasets, si…

A note on the longest common substring with k-mismatches problem

Sampling the suffix array with minimizers

Disk-based genome sequencing data compression

A note on the longest common substring with $k$ -mismatches problem