Efficient recognition of folds in protein 3D structures by the improved PRIDE algorithm

Authors:
Zoltán Gáspári;Kristian Vlahovicek;Sándor Pongor
Affiliations:
Bioinformatics Group, Biological Research Center, Hungarian Academy of Sciences Temesvári krt., 62, Szeged, Hungary;Protein Structure and Bioinformatics, International Centre for Genetic Engineering and Biotechnology Area Science Park, Padriciano 99, 34012 Trieste, Italy;Bioinformatics Group, Biological Research Center, Hungarian Academy of Sciences Temesvári krt., 62, Szeged, Hungary
Venue:
Bioinformatics
Year:
2005

Citing 0
Cited 4

A One-Class Classification Approach for Protein Sequences and Structures

ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
A modified Markov clustering approach to unsupervised classification of protein sequences

Neurocomputing
Protein blocks versus hydrogen bonds based alphabets for protein structure classification

Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Alignment-free local structural search by writhe decomposition

WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	3.84

Visualization

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.