Sentence examples for pattern matching problem from inspiring English sources

The current paper makes two contributions for the graph pattern matching problem of model transformation tools.

We present a filtering based algorithm for the k-mismatch pattern matching problem with don't cares.

For all the above reasons, SAX can be quite readily utilized onto our pattern matching problem of driving event detection.

We revise the statement of the graph pattern matching problem given in Sect. 2 for quantified patterns as follows.

Our approach is validated through a pattern matching problem in astronomical images that consists of detecting very faint objects: low surface brightness galaxies.

Based on the proposed index, we directly obtain improved results for the successive indexing problem and the position-restricted pattern matching problem in the literature.

CGR is found to provide the latter and to promise the former: graph-based data structures for sequence analysis operations are entailed by numerical-based data structures produced by CGR maps, providing a unifying analytical framework for a diversity of pattern matching problems.

We show how such a pattern-matching problem can be formulated as an estimation of the posterior distribution of a Bayesian probabilistic model.

Perhaps our community of users can come up with novel ways to solve pattern-matching problems like that.

Our reduction provides a solution to the pattern matching with swaps problem in time O(nlogmlogσ).

In this paper we show the first algorithm that solves the pattern matching with swaps problem in time o(nm).