<テクニカルレポート>
A Parallel Computation for Shift-Add Algorithm

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 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.続きを見る

本文情報を非表示

trcs230 pdf 95.3 KB 42  

詳細

レコードID
査読有無
関連情報
タイプ
登録日 2009.04.22
更新日 2017.01.27