计算机科学
多序列比对
数据挖掘
聚类分析
序列(生物学)
启发式
树(集合论)
算法
自由序列分析
模式(计算机接口)
明星(博弈论)
过程(计算)
排名(信息检索)
动态规划
序列比对
模式识别(心理学)
人工智能
数学
数学分析
生物化学
化学
遗传学
生物
肽序列
基因
操作系统
作者
Juntao Chen,Jiannan Chao,Huan Liu,Fenglong Yang,Quan Zou,Furong Tang
摘要
Abstract Multiple sequence alignment is widely used for sequence analysis, such as identifying important sites and phylogenetic analysis. Traditional methods, such as progressive alignment, are time-consuming. To address this issue, we introduce StarTree, a novel method to fast construct a guide tree by combining sequence clustering and hierarchical clustering. Furthermore, we develop a new heuristic similar region detection algorithm using the FM-index and apply the k-banded dynamic program to the profile alignment. We also introduce a win-win alignment algorithm that applies the central star strategy within the clusters to fast the alignment process, then uses the progressive strategy to align the central-aligned profiles, guaranteeing the final alignment's accuracy. We present WMSA 2 based on these improvements and compare the speed and accuracy with other popular methods. The results show that the guide tree made by the StarTree clustering method can lead to better accuracy than that of PartTree while consuming less time and memory than that of UPGMA and mBed methods on datasets with thousands of sequences. During the alignment of simulated data sets, WMSA 2 can consume less time and memory while ranking at the top of Q and TC scores. The WMSA 2 is still better at the time, and memory efficiency on the real datasets and ranks at the top on the average sum of pairs score. For the alignment of 1 million SARS-CoV-2 genomes, the win-win mode of WMSA 2 significantly decreased the consumption time than the former version. The source code and data are available at https://github.com/malabz/WMSA2.
科研通智能强力驱动
Strongly Powered by AbleSci AI