29 search results - page 5 / 6 » Faster Filters for Approximate String Matching |
LCN
2008
IEEE
14 years 2 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
ICAIL
2003
ACM
14 years 1 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
SIGMETRICS
2010
ACM
14 years 1 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
CPM
2001
Springer
14 years 1 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...