AbstractTwo strings parameterize match if there is a bijection defined on the alphabet that transforms the first string character by character into the second string. The problem of finding all parameterized matches of a pattern in a text has been studied in both one and two dimensions but the research has been centered on developing algorithms with good worst-case performance. We present algorithms that solve this problem in sublinear time on average for moderately repetitive patterns
AbstractThe exact string matching problem is to find the occurrences of a pattern of length m from a...
We improve the fastest known algorithm for approximate string matching. This algorithm can only be u...
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been...
AbstractTwo strings parameterize match if there is a bijection defined on the alphabet that transfor...
We consider the problem of finding a bijection to match a pattern in a text where both the pattern a...
Abstract Two equal length strings, or two equal sized two dimensional texts, parameterize match (p-m...
In the molecular biology, it is said that two biological sequences tend to have similar properties i...
Two equal length strings s and s ′ , over alphabets Σs and Σs ′, parameterize match if there exists ...
Abstract. Two equal length strings s and s ′, over alphabets s and s ′ , parameterize match if there...
The classical pattern matching paradigm is that of seeking occurrences of one string in another, whe...
AbstractWe study approximate string-matching in connection with two string distance functions that a...
AbstractConsider the string matching problem where differences between characters of the pattern and...
Given a text T of length n and a pattern P of length m, the string matching problem is a task to fin...
AbstractWe extend Baker's theory of parameterized string matching (1993) to algorithms that match mu...
The q-gram filter is a popular filtering method for approximate string matching. It compares substri...
AbstractThe exact string matching problem is to find the occurrences of a pattern of length m from a...
We improve the fastest known algorithm for approximate string matching. This algorithm can only be u...
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been...
AbstractTwo strings parameterize match if there is a bijection defined on the alphabet that transfor...
We consider the problem of finding a bijection to match a pattern in a text where both the pattern a...
Abstract Two equal length strings, or two equal sized two dimensional texts, parameterize match (p-m...
In the molecular biology, it is said that two biological sequences tend to have similar properties i...
Two equal length strings s and s ′ , over alphabets Σs and Σs ′, parameterize match if there exists ...
Abstract. Two equal length strings s and s ′, over alphabets s and s ′ , parameterize match if there...
The classical pattern matching paradigm is that of seeking occurrences of one string in another, whe...
AbstractWe study approximate string-matching in connection with two string distance functions that a...
AbstractConsider the string matching problem where differences between characters of the pattern and...
Given a text T of length n and a pattern P of length m, the string matching problem is a task to fin...
AbstractWe extend Baker's theory of parameterized string matching (1993) to algorithms that match mu...
The q-gram filter is a popular filtering method for approximate string matching. It compares substri...
AbstractThe exact string matching problem is to find the occurrences of a pattern of length m from a...
We improve the fastest known algorithm for approximate string matching. This algorithm can only be u...
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been...
DOI
Add to ORKG