102 search results - page 9 / 21 » Fast exact string matching algorithms |
LATIN
1998
Springer
14 years 24 days ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
TSD
2004
Springer
14 years 1 months ago
2004
Springer
In this paper a speaker adaptation methodology is proposed, which first automatically determines a number of speaker clusters in the training material, then estimates the paramete...
FUN
2010
Springer
14 years 1 months ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
IPPS
2008
IEEE
14 years 3 months ago
2008
IEEE
Our digital universe is growing, creating exploding amounts of data which need to be searched, protected and filtered. String searching is at the core of the tools we use to curb...
SPIRE
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...