Efficient recognition of folds in protein 3D structures by the improved PRIDE algorithm
Open Access
- 24 May 2005
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (15) , 3322-3323
- https://doi.org/10.1093/bioinformatics/bti513
Abstract
Summary: An improved version of the PRIDE (PRobaility of IDEntity) fold prediction algorithm has been developed, based on more solid statistical basis, fast search capabilities and efficient input structure processing. The new algorithm is effective in identifying protein structures at the ‘H’ level of the CATH hierarchy. Availability: The new algorithm is integrated into the PRIDE2 web servers at http://pride.szbk.u-szeged.hu and http://www.icgeb.org/pride Contact:pongor@icgeb.org Supplementary information: Detailed documentation and performance evaluation is available in the description section of the PRIDE2 web server.Keywords
This publication has 11 references indexed in Scilit:
- Déjà Vu All Over AgainFinding and Analyzing Protein Structure SimilaritiesStructure, 2004
- A simple fold with variations: the pacifastin inhibitor familyBioinformatics, 2004
- Evaluation of protein fold comparison serversProteins-Structure Function and Bioinformatics, 2003
- The PRIDE server for protein three-dimensional similarityJournal of Applied Crystallography, 2002
- Protein fold similarity estimated by a probabilistic approach based on Cα-Cα distance comparisonJournal of Molecular Biology, 2002
- The Protein Data BankNucleic Acids Research, 2000
- CATH – a hierarchic classification of protein domain structuresPublished by Elsevier ,1997
- Enlarged representative set of protein structuresProtein Science, 1994
- Protein Structure Comparison by Alignment of Distance MatricesJournal of Molecular Biology, 1993
- Selection of representative protein data setsProtein Science, 1992