AbstractTwo improved algorithms for string matching with k mismatches are presented. One algorithm is based on fast integer multiplication algorithms whereas the other follows more closely classic string-matching techniques
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
Abstract. We present a new bit-parallel technique for approximate string matching. We build on two p...
Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are...
AbstractConsider the string matching problem where differences between characters of the pattern and...
AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm f...
AbstractTwo improved algorithms for string matching with k mismatches are presented. One algorithm i...
This paper deals with the approximate string-matching problem with Hamming distance. The approximate...
AbstractConsider the string matching problem where differences between characters of the pattern and...
This paper deals with the approximate string-matching problem with Hamming distance. The approximate...
This paper surveys techniques for designing efficient sequential and parallel approximate string mat...
AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm f...
AbstractThis paper surveys techniques for designing efficient sequential and parallel approximate st...
AbstractIn the approximate string matching problem, differences are allowed between the pattern stri...
In many situations, an exact search of a pattern in a text does not find all interesting parts of th...
AbstractIn the approximate string matching problem, differences are allowed between the pattern stri...
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
Abstract. We present a new bit-parallel technique for approximate string matching. We build on two p...
Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are...
AbstractConsider the string matching problem where differences between characters of the pattern and...
AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm f...
AbstractTwo improved algorithms for string matching with k mismatches are presented. One algorithm i...
This paper deals with the approximate string-matching problem with Hamming distance. The approximate...
AbstractConsider the string matching problem where differences between characters of the pattern and...
This paper deals with the approximate string-matching problem with Hamming distance. The approximate...
This paper surveys techniques for designing efficient sequential and parallel approximate string mat...
AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm f...
AbstractThis paper surveys techniques for designing efficient sequential and parallel approximate st...
AbstractIn the approximate string matching problem, differences are allowed between the pattern stri...
In many situations, an exact search of a pattern in a text does not find all interesting parts of th...
AbstractIn the approximate string matching problem, differences are allowed between the pattern stri...
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
Abstract. We present a new bit-parallel technique for approximate string matching. We build on two p...
Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are...
DOI
Add to ORKG