CPM
2007
Springer
13 years 11 months ago
2007
Springer
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...