摘要
提出一种改进的SortMatAlign算法,通过快速排序预处理距离矩阵,使MatAlign算法的时间复杂度由O(N4)降为O(N3).结果表明,SortMatAlign算法计算出的RMSD值平均是MatAlign算法的1.098倍,使用残基个数和RMSD综合衡量标准的S值平均是MatAlign算法的0.968倍,在同等条件下,运行速度比MatAlign提高18.276倍.
An improved SortMatAlign method was proposed by which MatAlign time complexity was reduced from O(N^4) to 0 (N^3) by quick sort and pretreatment of distance matrices. Experiment results support the new method's feasibility and effectiveness. On the average, the value of RMSD by SortMatAlign is 1.098 times that by MatAlign, and the S value comprehensively evaluated by the number of residue pairs and RMSD is 0.968 times that by MatAlign. SortMatAlign is 18.276 times faster than MatAlign to get the same result.
出处
《吉林大学学报(理学版)》
CAS
CSCD
北大核心
2008年第4期670-674,共5页
Journal of Jilin University:Science Edition
基金
国家自然科学基金(批准号:6043302060673099)
吉林大学"985工程"项目基金