381 search results - page 49 / 77 » Approximate Matching of Hierarchical Data Using pq-Grams |
VLDB
2002
ACM
14 years 8 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...
BMCBI
2005
13 years 7 months ago
2005
Background: The development of high-throughput technologies such as yeast two-hybrid systems and mass spectrometry technologies has made it possible to generate large protein-prot...
SIGIR
1998
ACM
13 years 12 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....
KAIS
2006
13 years 7 months ago
2006
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
DEBU
2010
13 years 7 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...