| 作成者 |
|
|
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| JaLC DOI |
|
| 関連DOI |
|
| 関連URI |
|
| 関連情報 |
|
| 概要 |
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.続きを見る
|
Mendeley出力
