[HTML][HTML] Circular pattern matching with k mismatches
P Charalampopoulos, T Kociumaka, SP Pissis… - Journal of Computer and …, 2021 - Elsevier
We consider the circular pattern matching with k mismatches (k-CPM) problem in which one
is to compute the minimal Hamming distance of every length-m substring of T and any cyclic …
is to compute the minimal Hamming distance of every length-m substring of T and any cyclic …
The dynamic k-mismatch problem
The text-to-pattern Hamming distances problem asks to compute the Hamming distances
between a given pattern of length $ m $ and all length-$ m $ substrings of a given text of …
between a given pattern of length $ m $ and all length-$ m $ substrings of a given text of …
Counting patterns in strings and graphs
P Wellnitz - 2021 - publikationen.sulb.uni-saarland.de
We study problems related to finding and counting patterns in strings and graphs. In the
string-regime, we are interested in counting how many substring of a text 𝑇 are at Hamming …
string-regime, we are interested in counting how many substring of a text 𝑇 are at Hamming …