122 search results - page 14 / 25 » The approximability of the String Barcoding problem |
JDA
2007
13 years 7 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
FCCM
2011
IEEE
12 years 11 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...