Statistical Comparative Study of Multiple Sequence Alignment Scores of Iterative Refinement Algorithms
スポンサーリンク
概要
- 論文の詳細を見る
Iterative refinement algorithm is a useful method to improve the alignment results. In this paper, we evaluated different iterative refinement algorithms statistically. There are four iterative refinement algorithms: remove first (RF), bestfirst (BF), random (RD), and tree-based (Tb) iterative refinement algorithm. And there are two scoring functions for measuring the iteration judgment step: log expectation (LE) and weighted sum-of-pairs (SP) scores. There are two sequence clustering methods: neighbor-joining (NJ) method and unweighted pair-group method with arithmetic mean (UPGMA). We performed comprehensive analyses of these alignment strategies and compared these strategies using BAliBASE SP (BSP) score. We observed the behavior of scores from the view point of cumulative frequency (CF) and other basic statistical parameters. Ultimately, we tested the statistical significance of all alignment results by using Friedman nonparametric analysis of variance (ANOVA) test for ranks and Scheffé multiple comparison test.
- 2009-06-22
著者
-
Takeo Okazaki
Faculty Of Engineering University Of The Ryukyus
-
Takeo Okazaki
Department Of Information Engineering Faculty Of Engineering University Of The Ryukyus
-
Daigo Wakatsu
Information Engineering Course Graduate School Of Engineering And Science University Of The Ryukyus
関連論文
- Genetic Network Similarity based on Alignment Score
- A study of DNA assembly algorithm usingshortest common superstring problem
- Statistical Comparative Study of Multiple Sequence Alignment Scores of Iterative Refinement Algorithms
- Vertex Similarity based on Network Characteristics for Alignment of directed Vertex Similarity based on Network Characteristics for Alignment of directed graphs
- A study of double assembly method for DNA sequences
- Global Network Alignment Method Using Node Similarity Based on Network Characteristics