AbstractWe present a new and more rigorous analysis of the two algorithms for two-dimensional approximate pattern matching due to Kärkkäinen and Ukkonen. We also present modifications of these algorithms that use less space while keeping the same expected time
Algorithms with optimal expected running time are presented for searching the occurrences of a two-d...
Computing the distance between a given pattern of length n and a text of length m is defined as calc...
This paper surveys techniques for designing efficient sequential and parallel approximate string mat...
AbstractWe present a new and more rigorous analysis of the two algorithms for two-dimensional approx...
AbstractAn approximate string-matching algorithm is described based on earlier attribute-matching al...
We study in depth a model of non-exact pattern matching based on edit distance, which is the minimum...
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...
AbstractWe introduce the following optimization version of the classical pattern matching problem (r...
AbstractThe problem of approximate pattern matching on hypertext is defined and solved by Amir et al...
We give an algorithm which finds all occurrences of an m1 x m2 pattern array embedded as subarrays...
Abstract Background The problem of approximate string matching is important in many different areas ...
Given a text T of length n and a pattern P of length m, the approximate pattern matching problem ask...
AbstractWe introduce a new dimension to the widely studied on-line approximate string matching probl...
AbstractThis paper surveys techniques for designing efficient sequential and parallel approximate st...
Algorithms with optimal expected running time are presented for searching the occurrences of a two-d...
Computing the distance between a given pattern of length n and a text of length m is defined as calc...
This paper surveys techniques for designing efficient sequential and parallel approximate string mat...
AbstractWe present a new and more rigorous analysis of the two algorithms for two-dimensional approx...
AbstractAn approximate string-matching algorithm is described based on earlier attribute-matching al...
We study in depth a model of non-exact pattern matching based on edit distance, which is the minimum...
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...
AbstractWe introduce the following optimization version of the classical pattern matching problem (r...
AbstractThe problem of approximate pattern matching on hypertext is defined and solved by Amir et al...
We give an algorithm which finds all occurrences of an m1 x m2 pattern array embedded as subarrays...
Abstract Background The problem of approximate string matching is important in many different areas ...
Given a text T of length n and a pattern P of length m, the approximate pattern matching problem ask...
AbstractWe introduce a new dimension to the widely studied on-line approximate string matching probl...
AbstractThis paper surveys techniques for designing efficient sequential and parallel approximate st...
Algorithms with optimal expected running time are presented for searching the occurrences of a two-d...
Computing the distance between a given pattern of length n and a text of length m is defined as calc...
This paper surveys techniques for designing efficient sequential and parallel approximate string mat...
DOI
Add to ORKG