In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
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...
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
Hendrik Jan Hoogeboom, Walter A. Kosters, Jeroen F...
Abstract We propose in this paper a novel approach to the classification of discrete sequences. This approach builds a model fitting some dynamical features deduced from the learni...