Sciweavers

242 search results - page 3 / 49
» Approximate substring selectivity estimation
Sort
View
CSB
2003
IEEE
13 years 10 months ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
11 years 7 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 5 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
ECML
2006
Springer
13 years 9 months ago
Sequence Discrimination Using Phase-Type Distributions
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...
Jérôme Callut, Pierre Dupont