| Creator |
|
|
|
|
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| JaLC DOI |
|
| Related DOI |
|
| Related URI |
|
| Relation |
|
| Abstract |
This paper presents a parallel algorithm for solving the edit distance problem. The edit distance represents a similarity of two strings and the dynamic programming approach is a general paradigm to c...ompute an edit distance. There exists an efficient method of parallel computation which is based on bit-operations, however the computation in this method is very complex. In this paper, a simple parallel-algorithm for a single processor is proposed. Moreover, our algorithm can be applied to the alignment problem.show more
|
Export Mendeley
p001