308 citations · 462 across the 24 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012
Approximate pattern matching with k-mismatches in packed text
Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson
Given strings of length and of length over an alphabet of size , the string matching with -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 and a text , both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of occurs in …