Efficient SCOP-fold classification and retrieval using index-based protein substructure alignments

Bioinformatics. 2009 Oct 1;25(19):2559-65. doi: 10.1093/bioinformatics/btp474. Epub 2009 Aug 10.

Abstract

Motivation: To investigate structure-function relationships, life sciences researchers usually retrieve and classify proteins with similar substructures into the same fold. A manually constructed database, SCOP, is believed to be highly accurate; however, it is labor intensive. Another known method, DALI, is also precise but computationally expensive. We have developed an efficient algorithm, namely, index-based protein substructure alignment (IPSA), for protein-fold classification. IPSA constructs a two-layer indexing tree to quickly retrieve similar substructures in proteins and suggests possible folds by aligning these substructures.

Results: Compared with known algorithms, such as DALI, CE, MultiProt and MAMMOTH, on a sample dataset of non-redundant proteins from SCOP v1.73, IPSA exhibits an efficiency improvement of 53.10, 16.87, 3.60 and 1.64 times speedup, respectively. Evaluated on three different datasets of non-redundant proteins from SCOP, average accuracy of IPSA is approximately equal to DALI and better than CE, MAMMOTH, MultiProt and SSM. With reliable accuracy and efficiency, this work will benefit the study of high-throughput protein structure-function relationships.

Availability: IPSA is publicly accessible at http://ProteinDBS.rnet.missouri.edu/IPSA.php

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms*
  • Computational Biology / methods*
  • Databases, Protein
  • Protein Folding
  • Proteins / chemistry*
  • Proteins / classification*
  • Sequence Alignment*
  • Sequence Analysis, Protein

Substances

  • Proteins