SVM-based detection of distant protein structural relationships using pairwise probabilistic suffix trees

Ogul H., Mumcuoglu E. U.

COMPUTATIONAL BIOLOGY AND CHEMISTRY, vol.30, no.4, pp.292-299, 2006 (SCI-Expanded) identifier identifier identifier

  • Publication Type: Article / Article
  • Volume: 30 Issue: 4
  • Publication Date: 2006
  • Doi Number: 10.1016/j.compbiolchem.2006.05.001
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.292-299
  • Keywords: family classification, probabilistic suffix tree, sequence similarity, support vector machine, SEQUENCE, SIMILARITY, DATABASE, SEARCH
  • Middle East Technical University Affiliated: Yes


A new method based on probabilistic suffix trees (PSTs) is defined for pairwise comparison of distantly related protein sequences. The new definition is adopted in a discriminative framework for protein classification using pairwise sequence similarity scores in feature encoding. The framework uses support vector machines (SVMs) to separate structurally similar and dissimilar examples. The new discriminative system, which we call as SVM-PST, has been tested for SCOP family classification task, and compared with existing discriminative methods SVM-BLAST and SVM-Pairwise, which use BLAST similarity scores and dynamic-programming-based alignment scores, respectively. Results have shown that SVM-PST is more accurate than SVM-BLAST and competitive with SVM-Pairwise. In terms of computational efficiency, PST-based comparison is much better than dynamic-programming-based alignment. We also compared our results with the original family-based PST approach from which we were inspired. The present method provides a significantly better solution for protein classification in comparison with the family-based PST model. (c) 2006 Elsevier Ltd. All rights reserved.