102 search results - page 7 / 21 » Fast exact string matching algorithms |
149
click to vote
COLING
2010
15 years 2 days 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. ...
116
click to vote
BIRTHDAY
2010
Springer
15 years 8 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...
131
Voted
SPIRE
2007
Springer
15 years 11 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...
134
click to vote
CSB
2003
IEEE
15 years 10 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...
127
click to vote
ICIAP
2007
ACM
16 years 5 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...