Add to ORKGAbstract. We present a new and efficient algorithm to solve the ’thresh-old all vs. all ’ problem, which involves searching of two strings (with length N and M respectively) for finding all maximal approximate matches of length at least S and with up to K differences. The algo-rithm is based on a novel graph model, and it solves the problem in time O(NMK2).
We consider string matching with variable length gaps. Given a string T and a pattern P consisting o...
AbstractWe study the exact number of symbol comparisons that are required to solve the string matchi...
International audienceWe consider a version of pattern matching useful in processing large musical d...
The threshold all-against-all problem in approximate string matching has important applications in b...
Substring searching is one of the most prominent problems in computer science. We described and comp...
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been...
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 two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings l...
AbstractGiven two strings A and B of lengths na and nb, na⩽nb, respectively, the all-substrings long...
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
Given two strings X and Y of lengths m and n, re-spectively, the all-substrings longest common subse...
AbstractThe exact string matching problem is to find the occurrences of a pattern of length m from a...
AbstractConsider the string matching problem where differences between characters of the pattern and...
Abstract. We present a new bit-parallel technique for approximate string matching. We build on two p...
We consider string matching with variable length gaps. Given a string T and a pattern P consisting o...
AbstractWe study the exact number of symbol comparisons that are required to solve the string matchi...
International audienceWe consider a version of pattern matching useful in processing large musical d...
The threshold all-against-all problem in approximate string matching has important applications in b...
Substring searching is one of the most prominent problems in computer science. We described and comp...
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been...
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 two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings l...
AbstractGiven two strings A and B of lengths na and nb, na⩽nb, respectively, the all-substrings long...
We present new algorithms for approximate string matching based in simple, but efficient, ideas. Fir...
Given two strings X and Y of lengths m and n, re-spectively, the all-substrings longest common subse...
AbstractThe exact string matching problem is to find the occurrences of a pattern of length m from a...
AbstractConsider the string matching problem where differences between characters of the pattern and...
Abstract. We present a new bit-parallel technique for approximate string matching. We build on two p...
We consider string matching with variable length gaps. Given a string T and a pattern P consisting o...
AbstractWe study the exact number of symbol comparisons that are required to solve the string matchi...
International audienceWe consider a version of pattern matching useful in processing large musical d...