{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:34:00Z","timestamp":1772138040597,"version":"3.50.1"},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T00:00:00Z","timestamp":1600992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"EU Horizon 2020 research and innovation programme under Marie Curie","award":["777822"],"award-info":[{"award-number":["777822"]}]},{"DOI":"10.13039\/100000002","name":"NIH","doi-asserted-by":"publisher","award":["GM123558"],"award-info":[{"award-number":["GM123558"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Motivation<\/jats:title>\n                    <jats:p>Protein fold recognition is a key step for template-based modeling approaches to protein structure prediction. Although closely related folds can be easily identified by sequence homology search in sequence databases, fold recognition is notoriously more difficult when it involves the identification of distantly related homologs. Recent progress in residue\u2013residue contact and distance prediction opens up the possibility of improving fold recognition by using structural information contained in predicted distance and contact maps.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>Here we propose to use the congruence coefficient as a metric of similarity between maps. We prove that this metric has several interesting mathematical properties which allow one to compute in polynomial time its exact mean and variance over all possible (exponentially many) alignments between two symmetric matrices, and assess the statistical significance of similarity between aligned maps. We perform fold recognition tests by recovering predicted target contact\/distance maps from the two most recent Critical Assessment of Structure Prediction editions and over 27\u2009000 non-homologous structural templates from the ECOD database. On this large benchmark, we compare fold recognition performances of different alignment tools with their own similarity scores against those obtained using the congruence coefficient. We show that the congruence coefficient overall improves fold recognition over other methods, proving its effectiveness as a general similarity metric for protein map comparison.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Availability and implementation<\/jats:title>\n                    <jats:p>The congruence coefficient software CCpro is available as part of the SCRATCH suite at: http:\/\/scratch.proteomics.ics.uci.edu\/.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Supplementary information<\/jats:title>\n                    <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btaa833","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T09:56:27Z","timestamp":1599731787000},"page":"506-513","source":"Crossref","is-referenced-by-count":1,"title":["Fold recognition by scoring protein maps using the congruence coefficient"],"prefix":"10.1093","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1838-8918","authenticated-orcid":false,"given":"Pietro","family":"Di Lena","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Bologna , Bologna 40126, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Baldi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of California , Irvine, CA 92697, USA"},{"name":"Institute for Genomics and Bioinformatics, University of California , Irvine, CA 92697, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"key":"2023051706071535800_btaa833-B1","doi-asserted-by":"crossref","first-page":"D376","DOI":"10.1093\/nar\/gkz1064","article-title":"The SCOP database in 2020: expanded classification of representative family and superfamily domains of known protein structures","volume":"48","author":"Andreeva","year":"2020","journal-title":"Nucleic Acids Res"},{"key":"2023051706071535800_btaa833-B2","doi-asserted-by":"crossref","first-page":"2684","DOI":"10.1093\/bioinformatics\/btx217","article-title":"EigenThreader: analogous protein fold recognition by efficient contact map threading","volume":"33","author":"Buchan","year":"2017","journal-title":"Bioinformatics"},{"key":"2023051706071535800_btaa833-B3","first-page":"95","article-title":"Factor analysis and canonical correlations","volume":"1","author":"Burt","year":"1948","journal-title":"Math. Stat. Psychol"},{"key":"2023051706071535800_btaa833-B4","doi-asserted-by":"crossref","first-page":"e1003926","DOI":"10.1371\/journal.pcbi.1003926","article-title":"ECOD: an evolutionary classification of protein domains","volume":"10","author":"Cheng","year":"2014","journal-title":"PLoS Comput. Biol"},{"key":"2023051706071535800_btaa833-B5","doi-asserted-by":"crossref","first-page":"2250","DOI":"10.1093\/bioinformatics\/btq402","article-title":"Fast overlapping of protein contact maps by alignment of eigenvectors","volume":"26","author":"Di Lena","year":"2010","journal-title":"Bioinformatics"},{"key":"2023051706071535800_btaa833-B6","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1093\/bioinformatics\/bts475","article-title":"Deep architectures for protein contact map prediction","volume":"28","author":"Di Lena","year":"2012","journal-title":"Bioinformatics"},{"key":"2023051706071535800_btaa833-B7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1038\/nrg3414","article-title":"Emerging methods in protein co-evolution","volume":"14","author":"De Juan","year":"2013","journal-title":"Nat. Rev. Genet"},{"key":"2023051706071535800_btaa833-B8","doi-asserted-by":"crossref","first-page":"e1002195","DOI":"10.1371\/journal.pcbi.1002195","article-title":"Accelerated profile HMM searches","volume":"7","author":"Eddy","year":"2011","journal-title":"PLoS Comput. Biol"},{"key":"2023051706071535800_btaa833-B9","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1002\/prot.25697","article-title":"Protein tertiary structure modeling driven by deep learning and contact distance prediction in CASP13","volume":"87","author":"Hou","year":"2019","journal-title":"Proteins"},{"key":"2023051706071535800_btaa833-B10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1002\/prot.340230308","article-title":"Protein structure prediction by threading methods: evaluation of current techniques","volume":"23","author":"Lemer","year":"1995","journal-title":"Proteins"},{"key":"2023051706071535800_btaa833-B11","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF02337560","article-title":"Protein fold recognition","volume":"7","author":"Jones","year":"1993","journal-title":"J. Comput. Aided Mol. Des"},{"key":"2023051706071535800_btaa833-B12","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1093\/bioinformatics\/btu791","article-title":"MetaPSICOV: combining coevolution methods for accurate prediction of contacts and long range hydrogen bonding in proteins","volume":"31","author":"Jones","year":"2015","journal-title":"Bioinformatics"},{"key":"2023051706071535800_btaa833-B13","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1002\/prot.25824","article-title":"Recent developments in deep learning applied to protein structure prediction","volume":"87","author":"Kandathil","year":"2019","journal-title":"Proteins"},{"key":"2023051706071535800_btaa833-B14","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/0167-9473(94)00064-2","article-title":"Refined approximations to permutation tests for multivariate inference","volume":"29","author":"Kazi-Aouala","year":"1995","journal-title":"Comput. Stat. Data Anal"},{"key":"2023051706071535800_btaa833-B15","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1002\/prot.25823","article-title":"Critical assessment of methods of protein structure prediction (CASP)? Round XIII","volume":"87","author":"Kryshtafovych","year":"2019","journal-title":"Proteins"},{"key":"2023051706071535800_btaa833-B16","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1038\/s41580-019-0163-x","article-title":"Advances in protein structure prediction and designAdvances in protein structure prediction and design","volume":"20","author":"Kuhlman","year":"2019","journal-title":"Nat. Rev. Mol. Cell Biol"},{"key":"2023051706071535800_btaa833-B17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.3923\/ajms.2011.66.70","article-title":"Concise formulas for the area and volume of a hyperspherical cap","volume":"4","author":"Li","year":"2011","journal-title":"Asian J. Math. Stat"},{"key":"2023051706071535800_btaa833-B18","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1126\/science.aah4043","article-title":"Protein structure determination using metagenome sequence data","volume":"355","author":"Ovchinnikov","year":"2017","journal-title":"Science"},{"key":"2023051706071535800_btaa833-B19","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1002\/prot.25834","article-title":"Protein structure prediction using multiple deep neural networks in the 13th Critical Assessment of Protein Structure Prediction (CASP13)","volume":"87","author":"Senior","year":"2019","journal-title":"Proteins"},{"key":"2023051706071535800_btaa833-B20","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1093\/protein\/11.9.739","article-title":"Protein structure alignment by incremental combinatorial extension of the optimum path","volume":"11","author":"Shindyalov","year":"1998","journal-title":"Protein Eng"},{"key":"2023051706071535800_btaa833-B21","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1002\/prot.25819","article-title":"Assessing the accuracy of contact predictions in CASP13","volume":"87","author":"Shrestha","year":"2019","journal-title":"Proteins"},{"key":"2023051706071535800_btaa833-B22","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1186\/s12859-019-3019-7","article-title":"HH-suite3 for fast remote homology detection and deep protein annotation","volume":"20","author":"Steinegger","year":"2019","journal-title":"BMC Bioinformatics"},{"key":"2023051706071535800_btaa833-B23","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1093\/nar\/gki524","article-title":"TM-align: a protein structure alignment algorithm based on TM-score","volume":"33","author":"Zhang","year":"2005","journal-title":"Nucleic Acids Res"},{"key":"2023051706071535800_btaa833-B24","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1002\/prot.25792","article-title":"Deep-learning contact-map guided protein structure prediction in CASP13","volume":"87","author":"Zheng","year":"2019","journal-title":"Proteins"},{"key":"2023051706071535800_btaa833-B25","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1002\/prot.25810","article-title":"Analysis of distance-based protein structure prediction by deep learning in CASP13","volume":"87","author":"Xu","year":"2019","journal-title":"Proteins"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btaa833\/34923429\/btaa833.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/37\/4\/506\/50359782\/btaa833.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/37\/4\/506\/50359782\/btaa833.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T02:14:33Z","timestamp":1684289673000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/37\/4\/506\/5911624"}},"subtitle":[],"editor":[{"given":"Elofsson","family":"Arne","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,9,25]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,5,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btaa833","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2020.05.20.106484","asserted-by":"object"}]},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2021,2,15]]},"published":{"date-parts":[[2020,9,25]]}}}