122 search results - page 20 / 25 » The approximability of the String Barcoding problem |
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
AIRS
2004
Springer
15 years 2 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...
SIGIR
1998
ACM
15 years 1 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
CJ
1999
14 years 9 months ago
1999
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...