Protein Sequences Analysis Based on Smoothed PST
Sequence alignment algorithms, which are hardly to be efficient, are frequently used in protein sequences analysis. In order to improve the analyzing efficiency, an improved PST(Probabilistic Suffix Trees) model is proposed in this paper. Firstly, by analyzing the similarity between protein sequences analysis and sequences data mining, the idea of using PST model to analyze protein sequences is presented; And then the standard PST model is improved by smoothing operation according to the features of protein sequences analysis; Next, taking the smoothed PST as features of data set, the similarities degree between protein sequences are calculated by using the similarities of the normalized sequences; At last, the effectiveness and high efficiency of the algorithm are verified by some protein sequences analysis examples.
Probabilistic Suffiz Trees smoothing protein sequences analysis
Yong Liu Tuanjun Yan Rui Zhang
Institute of Intelligent Vision and Image Information China Three Gorges University Yichang,China
国际会议
北京
英文
1-4
2009-06-11（万方平台首次上网日期，不代表论文的发表时间）