DOIAbstract
AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm for finding all occurrences of the pattern in the text, each with at most k mismatches. The algorithm runs in O(k(m log m + n)) time
AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm for finding all occurrences of the pattern in the text, each with at most k mismatches. The algorithm runs in O(k(m log m + n)) time
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
Given a text of length n and a pattern of length m, we present a parallel linear algorithm for findi...
We present solutions for the k-mismatch pattern matching problem with don\u27t cares. Given a text t...
AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm f...
AbstractConsider the string matching problem where differences between characters of the pattern and...
. We propose a simple but efficient algorithm for searching all occurrences of a pattern or a class ...
International audienceWe propose a simple but e cient algorithm for searching all occurrences of a p...
AbstractConsider the string matching problem where differences between characters of the pattern and...
AbstractTwo improved algorithms for string matching with k mismatches are presented. One algorithm i...
AbstractWe study the exact number of symbol comparisons that are required to solve the string matchi...
AbstractThe exact string matching problem is to find the occurrences of a pattern of length m from a...
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
This paper deals with the approximate string-matching problem with Hamming distance. The approximate...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
Given a text of length n and a pattern of length m, we present a parallel linear algorithm for findi...
We present solutions for the k-mismatch pattern matching problem with don\u27t cares. Given a text t...
AbstractGiven a text of length n, a pattern of length m, and an integer k, we present an algorithm f...
AbstractConsider the string matching problem where differences between characters of the pattern and...
. We propose a simple but efficient algorithm for searching all occurrences of a pattern or a class ...
International audienceWe propose a simple but e cient algorithm for searching all occurrences of a p...
AbstractConsider the string matching problem where differences between characters of the pattern and...
AbstractTwo improved algorithms for string matching with k mismatches are presented. One algorithm i...
AbstractWe study the exact number of symbol comparisons that are required to solve the string matchi...
AbstractThe exact string matching problem is to find the occurrences of a pattern of length m from a...
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
This paper deals with the approximate string-matching problem with Hamming distance. The approximate...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit di...
Given a text of length n and a pattern of length m, we present a parallel linear algorithm for findi...
We present solutions for the k-mismatch pattern matching problem with don\u27t cares. Given a text t...
Add to ORKG