308 citations · 462 across the 24 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.DS2013★ 4 cited
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
Szymon Grabowski
Calculating the length of a longest common subsequence (LCS) of two strings and of length and is a classic research topic, with many worst-case oriented results kno…
cs.DS2013
Efficient algorithms for the longest common subsequence in -length substrings
Sebastian Deorowicz, Szymon Grabowski
Finding the longest common subsequence in -length substrings (LCS) is a recently proposed problem motivated by computational biology. This is a generalization of the well-kno…
cs.DS2013★ 5 cited
Motif matching using gapped patterns
Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski +2
We present new algorithms for the problem of multiple string matching of gapped patterns, where a gapped pattern is a sequence of strings such that there is a gap of fixed length b…