Pattern-matching problems for two-dimensional images described by finite automata
Nordic Journal of Computing
Three Heuristics for delta-Matching: delta-BM Algorithms
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
δ γ --- Parameterized Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Efficient bit-parallel algorithms for (δ, α)-matching
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Efficient algorithms for pattern matching with general gaps and character classes
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Hi-index | 0.00 |
We present a new efficient algorithm for the δ-approximate matching problem with α-bounded gaps. The δ-approximate matching problem, recently introduced in connection with applications in music retrieval, generalizes the exact string matching problem by relaxing the notion of matching. Here we consider the case in which matchings may contain bounded gaps. An extensive comparison with the only (to our knowledge) other solution existing in the literature for the same problem, due to Crochemore et al., indicates that our algorithm is more efficient, especially in the cases of large alphabets and long patterns. In addition, our algorithm computes the total number of approximate matchings for each position of the text, requiring only ${\mathcal O}(m\alpha)$-space, where m is the length of the pattern.