Buscar
Mostrando ítems 1-10 de 85
Rotation and lighting invariant template matching
(2007)
We address the problem of searching for a two-dimensional pattern in a two-dimensional text (or image), such that the pattern can be found even if it appears rotated and it is brighter or darker than its occurrence. ...
Pattern matching
(CARFAX PUBLISHING, 2004-10)
An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most ...
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
(ELSEVIER SCIENCE BV, 2005-11-30)
We present new and faster algorithms to search for a two-dimensional pattern in a two-dimensional text allowing any rotation of the pattern. This has applications such as image databases and computational biology. We ...
Contextual Pattern Matching
(Springer Science and Business Media Deutschland GmbHinfo@springer-sbm.com, 2020)
Fast Indexes for Gapped Pattern Matching
(Springer, 2020)
Reporting consecutive substring occurrences under bounded gap constraints
(Elsevier, 2016)
We study the problem of indexing a text T[1...n] such that whenever a pattern P[1...p] and an interval [alpha, beta] come as a query, we can report all pairs (i, j) of consecutive occurrences of P in T with alpha <= j - i ...
A bit-parallel suffix automaton approach for (delta, gamma)-matching in music retrieval
(SPRINGER-VERLAG BERLIN, 2003)
delta, gamma)-Matching is a string matching problem with applications to music retrieval. The goal is, given a pattern P-1...m and a text T-1...n on an alphabet of integers, find the occurrences P' of the pattern in the ...
Improved single and multiple approximate string matching
(SPRINGER-VERLAG BERLIN, 2004)
We present a new algorithm for multiple approximate string matching. It is based on reading backwards enough l-grams from text windows so as to prove that no occurrence can contain the part of the window read, and then ...
Average complexity of exact and approximate multiple string matching
(ELSEVIER, 2004-08-16)
We show that the average number of characters examined to search for r random patterns of length m in a text of length n over a uniformly distributed alphabet of size a cannot be less than Omega(n log(sigma)(rm)/m). When ...
A Metric Index for Approximate String Matching
(Elsevier, 2006)
We present a radically new indexing approach for approximate string matching.
The scheme uses the metric properties of the edit distance and can be applied to
any other metric between strings. We build a metric space ...