| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
The approximate string matching is useful in a wide area of applications such as biology. A practically significant speedup for solving this problem is obtained by representing strings as bit sequence...s and computing the comparisons of plural characters simultaneously by bit operations. In this method, a practical run-time depends on the word size of a computer. In this paper, as another parameter of the performance of a computer, the number of processors is considered. An efficient algorithm based on the previous speedup method is modified into a parallel algorithm. In the concrete, an $ O(mnlogm/w) $ algorithm for a problem of approximate string matching is modified to an $ O(mn/w)$ algorithm for a computer with m processors.続きを見る
|
Mendeley出力
