2127 search results - page 18 / 426 » Computing large matchings fast |
SAC
2004
ACM
14 years 25 days ago
2004
ACM
JCB
2008
13 years 7 months ago
2008
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
ANCS
2006
ACM
14 years 1 months ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
ICVGIP
2004
13 years 8 months ago
2004
Fingerprint matching is the most important module in automatic person recognition using fingerprints. We model the nonlinear distortions and noise obtained during the fingerprint ...
WEBI
2009
Springer
14 years 2 months ago
2009
Springer
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...