3270 search results - page 28 / 654 » Approximate String Processing |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
IRAL
2003
ACM
14 years 26 days ago
2003
ACM
Though dynamic programming matching can carry out approximate string matching when there may be deletions or insertions in a document, its effectiveness and efficiency are usuall...
ICCSA
2010
Springer
14 years 2 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
ECIR
2006
Springer
13 years 9 months ago
2006
Springer
Rule-based email filters mainly rely on the occurrence of critical words to classify spam messages. However, perceptive obfuscation techniques can be used to elude exact pattern ma...