The recently introduced longest common substring with kmismatches (k-LCF) problem is to find, given two sequences S1 and S2 of length n each, a longest substring A1 of S1 and A2 of S2 such that the Hamming distance between A1 and A2 is at most k. So far, the only subquadratic time result for this problem was known for k = 1 [6]. We first present two output… (More)

@article{Grabowski2015ANO,
title={A note on the longest common substring with k-mismatches problem},
author={Szymon Grabowski},
journal={Inf. Process. Lett.},
year={2015},
volume={115},
pages={640-642}
}