NWアルゴリズム拡張による配列アラインメントの高速化についての検討

DOI Web Site Web Site 参考文献1件

書誌事項

タイトル別名
  • Accelerating Techniques for Sequence Alignment based on an Extended NW Algorithm
  • NW アルゴリズム カクチョウ ニ ヨル ハイレツ アラインメント ノ コウソクカ ニ ツイテ ノ ケントウ

この論文をさがす

抄録

<p>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.</p>

収録刊行物

参考文献 (1)*注記

もっと見る

関連プロジェクト

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ