output
19962026
most citedLow-Mass Dark Matter Search with the DarkSide-50 Experiment

443 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2014 · cs.DSShow all

5 papers · 2 filters

cs.DS2014★ 2 cited

A note on the longest common substring with -mismatches problem

Szymon Grabowski

The recently introduced longest common substring with -mismatches (-LCF) problem is to find, given two sequences and of length each, a longest substring …

cs.DS2014★ 308 cited

KMC 2: Fast and resource-frugal -mer counting

Sebastian Deorowicz, Marek Kokot, Szymon Grabowski +1

Motivation: Building the histogram of occurrences of every -symbol long substring of nucleotide data is a standard step in many bioinformatics applications, known under the name…

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★ 1 cited

Multiple pattern matching revisited

Robert Susik, Szymon Grabowski, Kimmo Fredriksson

We consider the classical exact multiple string matching problem. Our solution is based on -grams combined with pattern superimposition, bit-parallelism and alphabet size reduct…

cs.DS2014★ 3 cited

Two simple full-text indexes based on the suffix array

Szymon Grabowski, Marcin Raniszewski

We propose two suffix array inspired full-text indexes. One, called SA-hash, augments the suffix array with a hash table to speed up pattern searches due to significantly narrowed…