Sciweavers

CPM
2008
Springer
143views Combinatorics» more  CPM 2008»
14 years 2 months ago
A Black Box for Online Approximate Pattern Matching
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
Raphaël Clifford, Klim Efremenko, Benny Porat...
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
14 years 7 months ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach