{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,9]],"date-time":"2026-09-09T15:11:57Z","timestamp":1788966717859,"version":"build-2803163510"},"reference-count":12,"publisher":"Oxford University Press (OUP)","issue":"15","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,8,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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 \u2018H\u2019 level of the CATH hierarchy.<\/jats:p>\n               <jats:p>Availability: The new algorithm is integrated into the PRIDE2 web servers at http:\/\/pride.szbk.u-szeged.hu and http:\/\/www.icgeb.org\/pride<\/jats:p>\n               <jats:p>Contact: \u00a0pongor@icgeb.org<\/jats:p>\n               <jats:p>Supplementary information: Detailed documentation and performance evaluation is available in the description section of the PRIDE2 web server.<\/jats:p>","DOI":"10.1093\/bioinformatics\/bti513","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T02:38:44Z","timestamp":1116988724000},"page":"3322-3323","source":"Crossref","is-referenced-by-count":22,"title":["Efficient recognition of folds in protein 3D structures by the improved PRIDE algorithm"],"prefix":"10.1093","volume":"21","author":[{"given":"Zolt\u00e1n","family":"G\u00e1sp\u00e1ri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristian","family":"Vlahovicek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e1ndor","family":"Pongor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"2023051612005048200_B1","doi-asserted-by":"crossref","unstructured":"Berman, H.M., et al. 2000The Protein Data Bank. Nucleic Acids Res.  \u00a028\n\u00a0235\u2013242","DOI":"10.1093\/nar\/28.1.235"},{"key":"2023051612005048200_B2","doi-asserted-by":"crossref","unstructured":"Carugo, O. and Pongor, S. 2002Protein fold similarity estimated by a probabilistic approach based on C\u03b1 \u2013C\u03b1 distance comparison. J. Mol. Biol.  \u00a0315\n\u00a0887\u2013898","DOI":"10.1006\/jmbi.2001.5250"},{"key":"2023051612005048200_B3","doi-asserted-by":"crossref","unstructured":"G\u00e1sp\u00e1ri, Z., et al. 2004A simple fold with variations: the pacifastin inhibitor family. Bioinformatics  \u00a020\n\u00a0448\u2013451","DOI":"10.1093\/bioinformatics\/btg451"},{"key":"2023051612005048200_B4","doi-asserted-by":"crossref","unstructured":"Hobohm, U. and Sander, C. 1994Enlarged representative set of protein structures. Protein Sci.  \u00a03\n\u00a0522\u2013524","DOI":"10.1002\/pro.5560030317"},{"key":"2023051612005048200_B5","doi-asserted-by":"crossref","unstructured":"Hobohm, U., et al. 1992Selection of representative protein data sets from the Protein Data Bank. Protein Sci.  \u00a01\n\u00a0409\u2013417","DOI":"10.1002\/pro.5560010313"},{"key":"2023051612005048200_B6","doi-asserted-by":"crossref","unstructured":"Holm, L. and Sander, C. 1993Protein structure comparison by the alignment of distance matrices. J. Mol. Biol.  \u00a0233\n\u00a0123\u2013138","DOI":"10.1006\/jmbi.1993.1489"},{"key":"2023051612005048200_B7","doi-asserted-by":"crossref","unstructured":"Novotny, M., et al. 2003Evaluation of protein fold comparison servers. Proteins  \u00a054\n\u00a0260\u2013270","DOI":"10.1002\/prot.10553"},{"key":"2023051612005048200_B8","doi-asserted-by":"crossref","unstructured":"Orengo, C.A., et al. 1997CATH\u2014a hierarchic classification of protein domain structures. Structure  \u00a05\n\u00a01093\u20131108","DOI":"10.1016\/S0969-2126(97)00260-8"},{"key":"2023051612005048200_B9","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P. Numerical Recipes in C \u00a01992 2nd edn , Cambridge  Cambridge University Press"},{"key":"2023051612005048200_B10","doi-asserted-by":"crossref","unstructured":"Shindyalov, I.N. and Bourne, P.E. 1998Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Eng.  \u00a011\n\u00a0739\u2013747","DOI":"10.1093\/protein\/11.9.739"},{"key":"2023051612005048200_B11","doi-asserted-by":"crossref","unstructured":"Sierk, M.L. and Kleywegt, G.L. 2004\n\u00a0D\u00e9j\u00e0 vu all over again: finding and analyzing protein structure similarities. Structure  \u00a012\n\u00a02103\u20132111","DOI":"10.1016\/S0969-2126(04)00351-X"},{"key":"2023051612005048200_B12","doi-asserted-by":"crossref","unstructured":"Vlahovicek, K., et al. 2002The PRIDE server for ptotein three-dimensional similarity. J. Appl. Crystallogr.  \u00a035\n\u00a0648\u2013649","DOI":"10.1107\/S002188980201292X"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/15\/3322\/50340688\/bioinformatics_21_15_3322.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/15\/3322\/50340688\/bioinformatics_21_15_3322.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T12:02:31Z","timestamp":1684238551000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/15\/3322\/195605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,24]]},"references-count":12,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2005,8,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bti513","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2005,8]]},"published":{"date-parts":[[2005,5,24]]}}}