52 citations · 133 across the 25 of their papers we have counts for
3 papers · 2 filters
The k-mismatch problem revisited
Raphaël Clifford, Allyx Fontaine, Ely Porat +2
We revisit the complexity of one of the most basic problems in pattern matching. In the k-mismatch problem we must compute the Hamming distance between a pattern of length m and ev…
On Maximal Unbordered Factors
Gregory Kucherov, Alexander Loptev, Tatiana Starikovskaya
Given a string of length , its maximal unbordered factor is the longest factor which does not have a border. In this work we investigate the relationship between and the…
Dictionary matching in a stream
Raphael Clifford, Allyx Fontaine, Ely Porat +2
We consider the problem of dictionary matching in a stream. Given a set of strings, known as a dictionary, and a stream of characters arriving one at a time, the task is to report…