443 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of ŁódźPL34 papers
- Institute of MathematicsPL24 papers
- Instituto Politécnico NacionalMX15 papers
- Jagiellonian UniversityPL14 papers
- Centre National de la Recherche ScientifiqueFR13 papers
- Centro de Investigación y de Estudios Avanzados del Instituto Politécnico NacionalMX11 papers
- Indian Statistical InstituteIN11 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali del Gran SassoIT11 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di Roma IIT11 papers
- European Organization for Nuclear ResearchCH10 papers
- Gran Sasso Science InstituteIT10 papers
- Institute of PhysicsPL10 papers
3 papers · 2 filters
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…
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…
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…