74 search results - page 9 / 15 » Improved Approximate String Matching Using Compressed Suffix... |
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
BMCBI
2007
14 years 9 months ago
2007
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
89
Voted
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
ADC
2008
Springer
15 years 3 months ago
2008
Springer
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...