{ "id": "epze6j1p5v", "slug": "fold-recognition", "title": "Fold recognition", "updated": "2026-10-15", "topic_path": [ { "id": "life", "label": "Life and health", "api_url": "https://www.edgepedia.org/api/v1/topics/life" }, { "id": "life.biology", "label": "Biological foundations", "api_url": "https://www.edgepedia.org/api/v1/topics/life.biology" }, { "id": "life.biology.biochemistry", "label": "Biochemistry and metabolism", "api_url": "https://www.edgepedia.org/api/v1/topics/life.biology.biochemistry" }, { "id": "life.biology.biochemistry.practice", "label": "Biochemistry field and methods", "api_url": "https://www.edgepedia.org/api/v1/topics/life.biology.biochemistry.practice" } ], "geo": [ { "id": "geo.nongeo.t1946.life.biology.biochemistry.practice", "label": "Non-geographic · 1946 to 2000: Biochemistry field and methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.life.biology.biochemistry.practice", "path": [ { "id": "geo.nongeo", "label": "Non-geographic", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo" }, { "id": "geo.nongeo.t1946", "label": "Non-geographic · 1946 to 2000", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946" }, { "id": "geo.nongeo.t1946.life", "label": "Life and health", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.life" }, { "id": "geo.nongeo.t1946.life.biology", "label": "Biological foundations", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.life.biology" }, { "id": "geo.nongeo.t1946.life.biology.biochemistry", "label": "Biochemistry and metabolism", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.life.biology.biochemistry" }, { "id": "geo.nongeo.t1946.life.biology.biochemistry.practice", "label": "Biochemistry field and methods", "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.life.biology.biochemistry.practice" } ] } ], "excerpt": "Fold recognition, also known as protein fold recognition, is a protein structure prediction method that assigns a sequence to the known fold it most likely adopts by threading it through template structures.", "snippet": "Fold recognition, also known as protein fold recognition, is a protein structure prediction method that assigns a sequence to the known fold it most likely adopts by threading it through template structures.", "node": "life.biology.biochemistry.practice", "markdown": "# Fold recognition\n\nFold recognition is a protein structure prediction method that assigns a target sequence of unknown structure to the known structural fold it is most likely to adopt, by threading the sequence through a library of template structures and scoring sequence-structure compatibility. It occupies the middle ground between homology modeling, which requires a detectable evolutionary relationship, and ab initio prediction, which builds structures without templates. [Homology modeling](https://www.edgepedia.org/homology-modeling) is generally applicable when a known structure shares more than 25 to 30% pairwise sequence identity with the target; below that threshold, in the distant-homology regime, threading is the standard template-based approach.[1](https://www.sciencedirect.com/science/article/abs/pii/S0022283697911013) • [2](https://pmc.ncbi.nlm.nih.gov/articles/PMC8148041/)\n\n| Key fact | Detail |\n|---|---|\n| Output | Ranked fold assignment and target-template alignment; full model only in composite pipelines[3](https://doi.org/10.1186/1471-2105-9-40) |\n| Operating regime | Sequence identity below ~25-30%, where homology modeling fails[1](https://www.sciencedirect.com/science/article/abs/pii/S0022283697911013) • [4](https://pmc.ncbi.nlm.nih.gov/articles/PMC10893003/) |\n| Core scoring | 3D profiles, statistical potentials, profile-profile and HMM-HMM comparison, contact-map threading[5](https://doi.org/10.1126/science.1853201) • [6](https://academic.oup.com/bioinformatics/article/21/7/951/268976?login=true) |\n| Typical accuracy | Best methods: 75% correct at SCOP family level, 29% at superfamily, 15% at fold level (2005 assessment)[7](https://salilab.org/publication-archive/Madhusudhan_ProteomicsProtocols_2005.pdf) |\n| Template libraries | ~10,000 templates (FOLDpro era) to 6,331 PDB representatives at <30% identity (mGenTHREADER)[8](https://calla.rnet.missouri.edu/cheng/foldpro.pdf) • [9](https://link.springer.com/article/10.1186/1471-2105-7-288) |\n| Input | Sequence; most modern servers build MSAs and predicted secondary structure internally[6](https://academic.oup.com/bioinformatics/article/21/7/951/268976?login=true) |\n\n## How it works\n\nThe underlying idea is the [inverse protein folding](https://www.edgepedia.org/inverse-protein-folding) problem: given a known 3D structure, find which amino acid sequences are compatible with it. Bowie, Lüthy, and Eisenberg attacked this by scoring how well each residue of a query sequence fits the environment of the corresponding position in the template, with environments described by three descriptors: the buried area inaccessible to solvent, the fraction of side-chain area covered by polar atoms (O and N), and the local secondary structure.[5](https://doi.org/10.1126/science.1853201)\n\nModern scoring functions combine sequential features (sequence profiles, predicted secondary structure, solvent accessibility) with pairwise contact potentials, and most threading methods report a normalized alignment score in standard deviation units relative to the mean score over all templates in the library, a z-score used for homology detection.[2](https://pmc.ncbi.nlm.nih.gov/articles/PMC8148041/) Later families of methods replaced environment scores with profile-profile comparison and then with profile HMM-HMM comparison: HHsearch aligns two hidden Markov models and adds a correlation score that raises sensitivity by 5-10%, reporting both E-values and the probability that each match is a true positive.[6](https://academic.oup.com/bioinformatics/article/21/7/951/268976?login=true) Contact-guided threaders score alignments against predicted inter-residue contact or distance maps instead.[2](https://pmc.ncbi.nlm.nih.gov/articles/PMC8148041/)\n\n## How it is done\n\nThreading pipelines have four components: a scoring function, template searching, optimal query-template alignment, and 3D model building.[2](https://pmc.ncbi.nlm.nih.gov/articles/PMC8148041/) In practice the practitioner follows the four steps of comparative modeling: fold assignment, target-template alignment, model building, and model assessment.[7](https://salilab.org/publication-archive/Madhusudhan_ProteomicsProtocols_2005.pdf)\n\n1. **Template search.** The query sequence (usually via a multiple sequence alignment and predicted secondary structure) is compared against a library of representative structures. Template search methods fall into three classes: pairwise sequence comparison (BLAST, FASTA), sequence-profile methods ([PSI-BLAST](https://www.edgepedia.org/psi-blast), HMMER), and threading methods that combine sequence and structure information.[7](https://salilab.org/publication-archive/Madhusudhan_ProteomicsProtocols_2005.pdf)\n2. **Alignment and ranking.** Each candidate template is aligned to the query and scored; significance is judged by z-scores, E-values, or calibrated probabilities.[2](https://pmc.ncbi.nlm.nih.gov/articles/PMC8148041/) • [6](https://academic.oup.com/bioinformatics/article/21/7/951/268976?login=true)\n3. **Model building and assessment.** Aligned regions are copied from the template, unaligned loops are constructed, and the model is assessed; I-TASSER, for example, reports a C-score that correlates with TM-score of the first model with a Pearson coefficient of 0.91, and a C-score above -1.5 usually indicates a correct fold with TM-score above 0.5.[3](https://doi.org/10.1186/1471-2105-9-40) • [10](https://seq2fun.dcmb.med.umich.edu/papers/2015_14.pdf)\n\n## Origin\n\nThe statistical foundation was laid by Sippl, whose 1990 Journal of Molecular Biology paper derived potentials of mean force for evaluating conformational ensembles from known structures.[11](https://doi.org/10.1016/s0022-2836%2805%2980269-4) In 1990, Bowie and colleagues published a method matching hydrophobicity patterns of sequence sets with solvent accessibility patterns of known structures in Proteins Structure Function and [Bioinformatics](https://www.edgepedia.org/bioinformatics).[12](https://doi.org/10.1002/prot.340070307) In 1991, Bowie, Lüthy, and Eisenberg published the 3D profile method in Science, framing fold recognition as the inverse protein folding problem; their method detected the structural similarity between actins and 70-kilodalton heat shock proteins despite no detectable sequence similarity.[5](https://doi.org/10.1126/science.1853201) An approach fitted sequences directly onto the backbone coordinates of known structures, evaluating models with empirical potentials and incorporating specific pair interactions explicitly in full three-dimensional space.[13](https://staging.europepmc.org/article/MED/1614539) Lathrop proved in 1994 that the threading problem with sequence amino acid interaction preferences is NP-complete.[14](https://doi.org/10.1093/protein/7.9.1059) Miller, Jones, and Thornton published tools and assessment techniques for protein fold recognition by sequence threading in 1996 in The FASEB Journal[15](https://doi.org/10.1096/fasebj.10.1.8566539), and Rost, Schneider, and Sander introduced prediction-based threading in 1997 in the Journal of Molecular Biology, threading predicted 1D profiles into known structures.[16](https://doi.org/10.1006/jmbi.1997.1101)\n\n## Variants\n\nPublished methods fall into three broad categories: structure-seeded profile-based methods (3D-PSSM, Fugue), profile-profile alignment-based methods, and machine learning-based methods (mGenTHREADER, SVM-based systems).[17](https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-10-416.pdf)\n\n**Profile and HMM methods.** HHsearch, the most widely used profile-HMM threading method, generalizes sequence-HMM alignment to pairwise HMM-HMM alignment.[4](https://pmc.ncbi.nlm.nih.gov/articles/PMC10893003/) Phyre2 uses profile-profile and HMM-based alignment against a fold library and models about 70% of domains in a typical genome with cores within 2-4 Å r.m.s.d. of native.[18](https://www.sbg.bio.ic.ac.uk/phyre2/html/help.cgi?id=help%2Finterpret_normal)\n\n**Optimization and machine learning methods.** GenTHREADER, published by David T. Jones in 1999, was designed for genomic-scale fold recognition.[19](https://doi.org/10.1006/jmbi.1999.2583) RAPTOR (Xu and Li, 2003) formulates threading as a large-scale integer programming problem relaxed to linear programming, with the energy function \\( E = W_{m} \\cdot E_{m} + W_{s} \\cdot E_{s} + W_{p} \\cdot E_{p} + W_{g} \\cdot E_{g} + W_{ss} \\cdot E_{ss} \\) combining mutation, environment, pairwise interaction, gap, and secondary structure terms; in the CAFASP3 blind test it ranked first among individual servers for fold recognition on FR targets.[20](https://home.ttic.edu/~jinbo/SelectedPubs/RAPTOR.pdf) Its successor RaptorX (Peng and Xu, 2011) is a distinct statistical method using a nonlinear scoring function with single- and multiple-template threading and alignment quality prediction.[21](https://doi.org/10.1002/prot.23175) I-TASSER ([Yang Zhang](https://www.edgepedia.org/yang-zhang), 2008) threads through a PDB library using secondary-structure-enhanced profile-profile alignment, then assembles models by replica-exchange [Monte Carlo](https://www.edgepedia.org/monte-carlo).[3](https://doi.org/10.1186/1471-2105-9-40) FOLDpro feeds pairwise similarity features into SVMs to rank templates[8](https://calla.rnet.missouri.edu/cheng/foldpro.pdf), and DN-Fold applies deep networks as binary classifiers of whether a query-template pair shares a fold.[22](https://www.nature.com/articles/srep17573)\n\n**Contact-guided threading.** EigenTHREADER (Buchan and Jones, 2017) threads eigen-decomposed predicted contact maps[23](https://doi.org/10.1093/bioinformatics/btx217); DisCovER (Bhattacharya and colleagues, 2021) bins predicted distances into 9 bins of 1 Å and orientation dihedrals into 24 bins of 15°.[24](https://doi.org/10.1002/prot.26254) Meta-threading servers such as LOMETS combine the outputs of multiple threading programs.[4](https://pmc.ncbi.nlm.nih.gov/articles/PMC10893003/)\n\n## Applications\n\nAccuracy depends strongly on how distant the relationship is. In one assessment, the best fold-recognition method detected 75% of closest structures correctly at the SCOP family level, but only 29% at superfamily and 15% at fold level.[7](https://salilab.org/publication-archive/Madhusudhan_ProteomicsProtocols_2005.pdf) Later machine learning methods improved fold-level sensitivity: FOLDpro reached 27% with the top-ranked template and 48% with the top five[8](https://calla.rnet.missouri.edu/cheng/foldpro.pdf), and ensembled DN-Fold reached 33.6% Top-1 and 60.7% Top-5 at fold level.[22](https://www.nature.com/articles/srep17573) Rost's prediction-based threading found a structurally homologous region at first rank in 29% of cases, and correctly recognized the entire fold with 45 to 75% of first hits.[1](https://www.sciencedirect.com/science/article/abs/pii/S0022283697911013)\n\nThe main application is genome-wide fold annotation. mGenTHREADER assigned folds to over 72% of human proteome sequences with globular regions (23,112 of 32,010) at p < 0.05, versus about 46% for the sequence-profile GenTHREADER.[9](https://link.springer.com/article/10.1186/1471-2105-7-288)\n\n## Limitations and alternatives\n\nFold recognition degrades on multidomain proteins: I-TASSER is designed for single-domain globular proteins, and for multidomain targets the model may be inaccurate, so domain parsing is recommended.[10](https://seq2fun.dcmb.med.umich.edu/papers/2015_14.pdf) False positives among remote-homology hits are a persistent failure mode; even structure search of AlphaFold DB models produced 1,675 false positives among 133,813 high-scoring hits, mostly queries with multiple structured segments in incorrect relative orientations.[25](https://www.nature.com/articles/s41587-023-01773-0)\n\nCompared with ab initio prediction, threading trades independence from templates for reliability when a template exists. In CASP13, 67 of 112 test domains and in CASP14, 58 of 107 domains had reasonable templates in the PDB, defining the scope of template-based modeling.[26](https://journals.plos.org/ploscompbiol/article?id=10.1371%2Fjournal.pcbi.1008954) NDThreader, blindly tested in CASP14 within RaptorX, obtained the best average GDT score among all CASP14 servers on the 58 TBM targets.[26](https://journals.plos.org/ploscompbiol/article?id=10.1371%2Fjournal.pcbi.1008954)\n\nAlphaFold2 (Jumper and colleagues, 2021) achieved an average TM-score of 0.8871 on CASP14 domain-level assessments but 0.8514 on full-length assessments, indicating multidomain prediction remains harder.[27](https://doi.org/10.1038/s41586-021-03819-2) • [4](https://pmc.ncbi.nlm.nih.gov/articles/PMC10893003/) It has known weaknesses: difficulty with intrinsically disordered regions and loops longer than about 20 residues, a tendency to over-predict alpha helices in loops, a single predicted conformer, and no handling of ligands, cofactors, or complexes.[28](https://www.frontiersin.org/journals/bioinformatics/articles/10.3389/fbinf.2023.1120370/full) Its accuracy can be lower for targets with limited evolutionary information or outside the distribution of known folds it learned from.[28](https://www.frontiersin.org/journals/bioinformatics/articles/10.3389/fbinf.2023.1120370/full)\n\nFold recognition therefore persists in two forms. First, template detection remains the entry point for deep-learning pipelines: ColabFold replaces AlphaFold2's homology search with MMseqs2.[29](https://doi.org/10.1038/s41592-022-01488-1) Second, structure search over the predicted universe has become the new template library: the AlphaFold Protein Structure Database (Varadi and colleagues, 2021) made high-accuracy models for most cataloged proteins[30](https://doi.org/10.1093/nar/gkab1061), and Foldseek (van Kempen and colleagues, 2023) searches structures 4 to 5 orders of magnitude faster than Dali with 86-133% of the sensitivity of Dali, TM-align, and CE.[25](https://www.nature.com/articles/s41587-023-01773-0) AlphaFold 3 extends prediction to biomolecular interactions.[31](https://doi.org/10.1038/s41586-024-07487-w)\n\n## References\n\n1. [Protein fold recognition by prediction-based threading (Rost et al., JMB 1997)](https://www.sciencedirect.com/science/article/abs/pii/S0022283697911013)\n2. [Recent Advances in Protein Homology Detection Propelled by Inter-Residue Interaction Map Threading](https://pmc.ncbi.nlm.nih.gov/articles/PMC8148041/)\n3. [Yang Zhang (2008). I-TASSER server for protein 3D structure prediction. BMC Bioinformatics.](https://doi.org/10.1186/1471-2105-9-40)\n4. [Recent Progress of Protein Tertiary Structure Prediction](https://pmc.ncbi.nlm.nih.gov/articles/PMC10893003/)\n5. [James U. Bowie, Roland Lüthy, David Eisenberg (1991). A Method to Identify Protein Sequences That Fold into a Known Three-Dimensional Structure. Science.](https://doi.org/10.1126/science.1853201)\n6. [Protein homology detection by HMM–HMM comparison (HHsearch)](https://academic.oup.com/bioinformatics/article/21/7/951/268976?login=true)\n7. [Comparative Protein Structure Modeling (Madhusudhan, Marti-Renom, Sánchez, Sali)](https://salilab.org/publication-archive/Madhusudhan_ProteomicsProtocols_2005.pdf)\n8. [FOLDpro: a two-stage machine learning approach to protein fold recognition (Bioinformatics)](https://calla.rnet.missouri.edu/cheng/foldpro.pdf)\n9. [High throughput profile-profile based fold recognition for the entire human proteome (BMC Bioinformatics)](https://link.springer.com/article/10.1186/1471-2105-7-288)\n10. [Protein Structure and Function Prediction Using I-TASSER (Current Protocols in Bioinformatics)](https://seq2fun.dcmb.med.umich.edu/papers/2015_14.pdf)\n11. [Calculation of conformational ensembles from potentials of mena force (Journal of Molecular Biology, 1990)](https://doi.org/10.1016/s0022-2836%2805%2980269-4)\n12. [James U. Bowie and colleagues (1990). Identification of protein folds: Matching hydrophobicity patterns of sequence sets with solvent accessibility patterns of known structures. Proteins Structure Function and Bioinformatics.](https://doi.org/10.1002/prot.340070307)\n13. [A new approach to protein fold recognition (Jones, Taylor & Thornton, Nature 1992), Europe PMC abstract](https://staging.europepmc.org/article/MED/1614539)\n14. [Richard H. Lathrop (1994). The protein threading problem with sequence amino acid interaction preferences is NP-complete. Protein Engineering Design and Selection.](https://doi.org/10.1093/protein/7.9.1059)\n15. [R. T. Miller, D. T. Jones, J. M. Thornton (1996). Protein fold recognition by sequence threading: tools and assessment techniques. The FASEB Journal.](https://doi.org/10.1096/fasebj.10.1.8566539)\n16. [Burkhard Rost, Reinhard Schneider, Chris Sander (1997). Protein fold recognition by prediction-based threading. Journal of Molecular Biology.](https://doi.org/10.1006/jmbi.1997.1101)\n17. [An improved DescFold method for protein fold recognition (BMC Bioinformatics)](https://bmcbioinformatics.biomedcentral.com/counter/pdf/10.1186/1471-2105-10-416.pdf)\n18. [PHYRE Protein Fold Recognition Server, interpreting results](https://www.sbg.bio.ic.ac.uk/phyre2/html/help.cgi?id=help%2Finterpret_normal)\n19. [David T. Jones (1999). GenTHREADER: an efficient and reliable protein fold recognition method for genomic sequences. Journal of Molecular Biology.](https://doi.org/10.1006/jmbi.1999.2583)\n20. [RAPTOR: optimal protein threading by linear programming (J. Bioinformatics & Computational Biology)](https://home.ttic.edu/~jinbo/SelectedPubs/RAPTOR.pdf)\n21. [Jian Peng, Jinbo Xu (2011). Raptorx: Exploiting structure information for protein alignment by statistical inference. Proteins Structure Function and Bioinformatics.](https://doi.org/10.1002/prot.23175)\n22. [Improving Protein Fold Recognition by Deep Learning Networks (DN-Fold, Scientific Reports)](https://www.nature.com/articles/srep17573)\n23. [Daniel W A Buchan, David T Jones (2017). EigenTHREADER: analogous protein fold recognition by efficient contact map threading. Bioinformatics.](https://doi.org/10.1093/bioinformatics/btx217)\n24. [Sutanu Bhattacharya and colleagues (2021). DisCovER : distance‐ and orientation‐based covariational threading for weakly homologous proteins. Proteins Structure Function and Bioinformatics.](https://doi.org/10.1002/prot.26254)\n25. [Fast and accurate protein structure search with Foldseek (Nature Biotechnology)](https://www.nature.com/articles/s41587-023-01773-0)\n26. [Deep template-based protein structure prediction (NDThreader, PLOS Computational Biology)](https://journals.plos.org/ploscompbiol/article?id=10.1371%2Fjournal.pcbi.1008954)\n27. [John Jumper and colleagues (2021). Highly accurate protein structure prediction with AlphaFold. Nature.](https://doi.org/10.1038/s41586-021-03819-2)\n28. [Before and after AlphaFold2: An overview of protein structure prediction](https://www.frontiersin.org/journals/bioinformatics/articles/10.3389/fbinf.2023.1120370/full)\n29. [Milot Mirdita and colleagues (2022). ColabFold: making protein folding accessible to all. Nature Methods.](https://doi.org/10.1038/s41592-022-01488-1)\n30. [Mihaly Varadi and colleagues (2021). AlphaFold Protein Structure Database: massively expanding the structural coverage of protein-sequence space with high-accuracy models. Nucleic Acids Research.](https://doi.org/10.1093/nar/gkab1061)\n31. [Josh Abramson and colleagues (2024). Accurate structure prediction of biomolecular interactions with AlphaFold 3. Nature.](https://doi.org/10.1038/s41586-024-07487-w)\n\n---\n*Topic: Encyclopedia › Life and health › Biological foundations › Biochemistry and metabolism › Biochemistry field and methods*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n", "same_as": [ "https://home.ttic.edu/~jinbo/SelectedPubs/RAPTOR.pdf" ], "url": "https://www.edgepedia.org/fold-recognition", "markdown_url": "https://www.edgepedia.org/fold-recognition.md", "license": { "name": "Edgepedia Community License 1.0", "url": "https://www.edgepedia.org/edgepedia/license", "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.", "spdx": "LicenseRef-Edgepedia-Community-1.0" }, "credit": "\"Fold recognition\", Edgepedia (EdgeChat), https://www.edgepedia.org/fold-recognition. Edgepedia Community License 1.0.", "credit_md": "\"[Fold recognition](https://www.edgepedia.org/fold-recognition)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/fold-recognition](https://www.edgepedia.org/fold-recognition). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).", "credit_html": "\"Fold recognition\", Edgepedia (EdgeChat), https://www.edgepedia.org/fold-recognition. Edgepedia Community License 1.0.", "speakable": "Fold recognition, also known as protein fold recognition, is a protein structure prediction method that assigns a sequence to the known fold it most likely adopts by threading it through template structures." }