308 citations · 462 across the 24 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
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…
cs.DS2018
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…