電気学会論文誌D(産業応用部門誌)
Online ISSN : 1348-8163
Print ISSN : 0913-6339
特集論文
NWアルゴリズム拡張による配列アラインメントの高速化についての検討
尾風 仁山田 親稔宮城 桂市川 周一
著者情報
ジャーナル 認証あり

2016 年 136 巻 10 号 p. 686-691

詳細
抄録

The NW (Needleman-Wunsch) algorithm is a method of sequence alignment in bioinformatics. The NW algorithm can be applied for global sequence alignment, which is a way of arranging the sequences of DNA to identify regions of similarity. However, the NW algorithm requires a huge number of calculations compared with the SW (Smith-Waterman) algorithm. Many studies have focused on analyzing the output of multiple sequences quickly in three dimensions. However, such methods cannot obtain similarities for whole sequences. In this article, we extend the NW algorithm to three dimensions. The proposed method is expected to provide a fast analysis of high precision data sequences.

著者関連情報
© 2016 電気学会
前の記事 次の記事
feedback
Top