102 search results - page 7 / 21 » Fast exact string matching algorithms |
COLING
2010
13 years 3 months ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
BIRTHDAY
2010
Springer
13 years 12 months ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
SPIRE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
ICIAP
2007
ACM
14 years 8 months ago
2007
ACM
Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accu...