Computational Biology Research Center, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan.
Bioinformatics. 2010 Aug 1;26(15):1899-900. doi: 10.1093/bioinformatics/btq224. Epub 2010 Apr 28.
Multiple sequence alignment (MSA) is an important step in comparative sequence analyses. Parallelization is a key technique for reducing the time required for large-scale sequence analyses. The three calculation stages, all-to-all comparison, progressive alignment and iterative refinement, of the MAFFT MSA program were parallelized using the POSIX Threads library. Two natural parallelization strategies (best-first and simple hill-climbing) were implemented for the iterative refinement stage. Based on comparisons of the objective scores and benchmark scores between the two approaches, we selected a simple hill-climbing approach as the default.
The parallelized version of MAFFT is available at http://mafft.cbrc.jp/alignment/software/. This version currently supports the Linux operating system only.
多序列比对(MSA)是比较序列分析中的重要步骤。并行化是减少大规模序列分析所需时间的关键技术。使用 POSIX 线程库对 MAFFT MSA 程序的全对全比较、渐进比对和迭代细化三个计算阶段进行了并行化处理。针对迭代细化阶段,实现了两种自然的并行化策略(最佳优先和简单爬山法)。基于两种方法的目标分数和基准分数的比较,我们选择了简单爬山法作为默认方法。
MAFFT 的并行版本可在 http://mafft.cbrc.jp/alignment/software/ 获得。该版本目前仅支持 Linux 操作系统。