New Algorithms for Multiple Sequence Alignment

スポンサーリンク

概要

• 論文の詳細を見る

• We have developed two new exact algorithms for gapless multiple alignment of DNA sequences. Unlike previous exact algorithms, for sufficiently short motifs, the complexity of our algorithms do not grow exponentially in the number of sequences. One algorithm, which assumes a class of scoring functions which includes the information theoretic entry scoring function, is polynomial in the number of sequences although it is exponential in the width of the motifs to be aligned. The other algorithm is super exponential in the width of the motif but linear in the number of sequences for a very general class of scoring functions.

• 一般社団法人情報処理学会の論文
• 1998-11-26

著者

• Paul Horton

  Real World Computing Partnership

関連論文

• New Algorithms for Multiple Sequence Alignment

スポンサーリンク