Emanuele Giaquinta

activity

20102016

most citedLongest common substrings with k mismatches

36 citations · 94 across the 10 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

cs.DS2012

Approximate pattern matching with k-mismatches in packed text

Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson

Given strings $P$ of length $m$ and $T$ of length $n$ over an alphabet of size $σ$ , the string matching with $k$ -mismatches problem is to find the positions of all the substrings i…

cs.DS2012★ 27 cited

New algorithms for binary jumbled pattern matching

Emanuele Giaquinta, Szymon Grabowski

Given a pattern $P$ and a text $T$ , both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of $P$ occurs in $T$ …