108 search results - page 9 / 22 » Families of FPGA-Based Algorithms for Approximate String Mat... |
COLING
2010
13 years 2 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. ...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
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 ...
PR
2002
13 years 7 months ago
2002
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de ni...
DSD
2005
IEEE
14 years 1 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...