A complexity-based method for predicting protein subcellular location.
A complexity-based approach is proposed to predict subcellular location of proteins. Instead of extracting features from protein sequences as done previously, our approach is based on a complexity decomposition of symbol sequences. In the first step, distance between each pair of protein sequences is evaluated by the conditional complexity of one sequence given the other. Subcellular location of a protein is then determined using the k-nearest neighbor algorithm. Using three widely used data sets created by Reinhardt and Hubbard, Park and Kanehisa, and Gardy et al., our approach shows an improvement in prediction accuracy over those based on the amino acid composition and Markov model of protein sequences.
Zheng
Xiaoqi
X
Department of Applied Mathematics, Dalian University of Technology, 116024 Dalian, China.
Liu
Taigang
T
Wang
Jun
J
D000465:Algorithms; D000595:Amino Acid Sequence; D019295:Computational Biology / Q000379:methods*; D030562:Databases, Protein; D008969:Molecular Sequence Data; D011506:Proteins / Q000032:analysis* / Q000235:genetics; D013347:Subcellular Fractions / Q000737:chemistry*
D011506:Proteins