摘要
We describe parallel implementation of the metaheuristic approach to the problem of comparing strings representing DNA sequence. By this approach, one can define a whole new class of metrics on a set of strings;some of this metrics can lead to interesting results when used for string comparison. We propose several heuristics;compare results achieved when using those heuristics and compare parallel and sequential implementation of proposed approach.
We describe parallel implementation of the metaheuristic approach to the problem of comparing strings representing DNA sequence. By this approach, one can define a whole new class of metrics on a set of strings;some of this metrics can lead to interesting results when used for string comparison. We propose several heuristics;compare results achieved when using those heuristics and compare parallel and sequential implementation of proposed approach.
