Journal Article

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

Pin-Hao Chi, Bin Pang, Dmitry Korkin and Chi-Ren Shyu

in Bioinformatics

Volume 25, issue 19, pages 2559-2565
Published in print October 2009 | ISSN: 1367-4803
Published online August 2009 | e-ISSN: 1460-2059 | DOI:
Efficient SCOP-fold classification and retrieval using index-based protein substructure alignments

More Like This

Show all results sharing this subject:

  • Bioinformatics and Computational Biology


Show Summary Details


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


Supplementary information: Supplementary data are available at Bioinformatics online.

Journal Article.  5572 words.  Illustrated.

Subjects: Bioinformatics and Computational Biology

Full text: subscription required

How to subscribe Recommend to my Librarian

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.