55 search results - page 3 / 11 » More Efficient Algorithms for Closest String and Substring P... |
ACL
2012
11 years 11 months ago
2012
In this paper, we demonstrate that accurate machine translation is possible without the concept of “words,” treating MT as a problem of transformation between character string...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
CPM
1998
Springer
14 years 23 days ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
DIS
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...