Optimal Pattern Matching on Meshes
نویسندگان
چکیده
Parallel pattern matching on a mesh-connected array of processors is considered. The problem is to nd all occurrences of a pattern in a text. The input text is a string of n symbols placed in a p n p n mesh, each processor storing one symbol. The pattern is stored similarly in a contiguous portion of the mesh. An algorithm solving the problem in time O(p n) is presented. It applies a novel technique to design parallel pattern-matching algorithms based on the notion of a pseudo-period.
منابع مشابه
Optimal Parallel algorithm for String Matching on Mesh Network Structure
In this paper we consider the problem of string matching algorithm based on a two-dimensional mesh. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by using mesh connected network which achieves a constant time for mismatch a text string and we obtained O(¥. -ti...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملChallenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Detection of maximum common subgraph (MCS) is useful for matching, comparing and evaluate the similarity of patterns. MCS is a well known NP-complete problem for which optimal and suboptimal algorithms are known from the l...
متن کاملThe mimetic finite difference discretization of diffusion problem on unstructured polyhedral meshes
We study the mimetic finite difference discretization of diffusion-type problems on unstructured polyhedral meshes. We demonstrate high accuracy of the approximate solutions for general diffusion tensors, the second-order convergence rate for the scalar unknown and the first order convergence rate for the vector unknown on smooth or slightly distorted meshes, on non-matching meshes, and even on...
متن کاملA Combination of Feature Tracking and Pattern Matching with Optimal Parametrization for Sea Ice Drift Retrieval from SAR Data
Sea ice drift strongly influences sea ice thickness distribution and indirectly controls air-sea ice-ocean interactions. Estimating sea ice drift over a large range of spatial and temporal scales is therefore needed to characterize the properties of sea ice dynamics and to better understand the ongoing changes of the climate in the polar regions. An efficient algorithm is developed for processi...
متن کامل