78 search results - page 8 / 16 » On The Closest String and Substring Problems |
KAIS
2006
13 years 7 months ago
2006
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
The content-based publish/subscribe (pub/sub) paradigm for system design is becoming increasingly popular, offering unique benefits for a large number of data-intensive applicatio...
ICGI
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The computation of the probability of string generation according to stochastic grammars given only some of the symbols that compose it underlies pattern recognition prob...
ESA
2003
Springer
14 years 23 days ago
2003
Springer
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
WABI
2010
Springer
13 years 5 months ago
2010
Springer
The center string (or closest string) problem is a classical computer science problem with important applications in computational biology. Given k input strings and a distance thr...