18 search results - page 3 / 4 » Increased Bit-Parallelism for Approximate String Matching |
FQAS
2009
Springer
14 years 25 days ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
SIGMOD
2011
ACM
12 years 9 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...
VLDB
2002
ACM
14 years 6 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
ADC
2008
Springer
14 years 19 days 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...
SIGIR
1998
ACM
13 years 10 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....