A Parallel Approach to Solve the Approximation String Matching Problem
نویسندگان
چکیده
m p p p P 2 1 and an error bound k, we are asked to find whether there exists a prefix of T whose edit distance with P is smaller than or equal to k. The edit dance between A and B is the minimum number of insertion, deletion and substitution operations needed to transform B into A[4]. This problem can be computed by using dynamic programming method [5, 14]. Many approximate string matching algorithms employ this dynamic programming approach [1,2,3,6,7,8,9,10,11,13,14,15,16,17,18]. Let ) , ( j i c denote the edit distance between ) , 1 ( i T and ) , 1 ( j P . Then ) , ( j i c can be computed by the following formulas:
منابع مشابه
Bit-Parallel Operations to Investigate Properties of Logical Vectors by Logical Operations
In this paper, we discuss five problems which can be solved by using bit-parallel approach in constant time. And, these five problems often occur in many problems such as exact string matching problems and approximation string matching problems. According to the approaches for these five problems, we can solve exact string matching problems and approximation string matching problems more effici...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملA New Hybrid Meta-Heuristics Approach to Solve the Parallel Machine Scheduling Problem Considering Human Resiliency Engineering
This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملEfficient bit-parallel multi-patterns approximate string matching algorithms
Multi-patterns approximate string matching (MASM) problem is to find all the occurrences of set of patterns P0, P1, P2...Pr-1, r≥1, in the given text T[0...n-1], allowing limited number of errors in the matches. This problem has many applications in computational biology viz. finding DNA subsequences after possible mutations, locating positions of a disease(s) in a genome etc. The MASM problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010