237 search results - page 13 / 48 » Practical and Optimal String Matching |
WABI
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of finding the optimal pair of string patterns for discriminating between two sets of strings, i.e. finding the pair of patterns that is best with respect...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
AIRS
2004
Springer
14 years 1 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
BIOADIT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To realize this potential, the query optimizer ...