13 search results - page 2 / 3 » Pattern Matching Algorithms with Don't Cares |
JSA
2008
13 years 6 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...
IPPS
2006
IEEE
14 years 11 days ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
DCC
2006
IEEE
14 years 6 months ago
2006
IEEE
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...
CIKM
2004
Springer
13 years 11 months ago
2004
Springer
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
KDD
2004
ACM
14 years 6 months ago
2004
ACM
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. While complex matchings ...