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
We study in depth a model of non-exact pattern matching based on edit distance, which is the minimum...
AbstractA few lines pattern matching algorithm is obtained by using the correctness proof of program...
Given a text T of length n and a pattern P of length m, the approximate pattern matching problem ask...
AbstractWe present a new and more rigorous analysis of the two algorithms for two-dimensional approx...
This paper presents new efficient variants of the Baker and Bird and the Baeza-Yates and Regnier exa...
AbstractEfficient algorithms exist for the approximate two dimensional matching problem for rectangl...
AbstractThe most efficient currently known algorithms for two-dimensional pattern matching with rota...
AbstractWe introduce the following optimization version of the classical pattern matching problem (r...
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...
Pattern matching is the area of computer science which deals with security and analysis of data. Thi...
AbstractThe problem of approximate pattern matching on hypertext is defined and solved by Amir et al...
AbstractSimplified versions of Kedem–Landau–Palem algorithms for parallel one-dimensional and two-di...
Algorithms with optimal expected running time are presented for searching the occurrences of a two-d...
We study a recent algorithm for fast on-line approximate string matching. This is the problem of sea...
We study in depth a model of non-exact pattern matching based on edit distance, which is the minimum...
AbstractA few lines pattern matching algorithm is obtained by using the correctness proof of program...
Given a text T of length n and a pattern P of length m, the approximate pattern matching problem ask...
AbstractWe present a new and more rigorous analysis of the two algorithms for two-dimensional approx...
This paper presents new efficient variants of the Baker and Bird and the Baeza-Yates and Regnier exa...
AbstractEfficient algorithms exist for the approximate two dimensional matching problem for rectangl...
AbstractThe most efficient currently known algorithms for two-dimensional pattern matching with rota...
AbstractWe introduce the following optimization version of the classical pattern matching problem (r...
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...
Pattern matching is the area of computer science which deals with security and analysis of data. Thi...
AbstractThe problem of approximate pattern matching on hypertext is defined and solved by Amir et al...
AbstractSimplified versions of Kedem–Landau–Palem algorithms for parallel one-dimensional and two-di...
Algorithms with optimal expected running time are presented for searching the occurrences of a two-d...
We study a recent algorithm for fast on-line approximate string matching. This is the problem of sea...
We study in depth a model of non-exact pattern matching based on edit distance, which is the minimum...
AbstractA few lines pattern matching algorithm is obtained by using the correctness proof of program...
Given a text T of length n and a pattern P of length m, the approximate pattern matching problem ask...
DOI
Add to ORKG