CHOP proteins into structural domain‐like fragments
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We developed a method CHOP dissecting proteins into domain‐like fragments. The basic idea was to cut proteins beginning from very reliable experimental information (PDB), proceeding to expert annotations of domain‐like regions (Pfam‐A), and completing through cuts based on termini of known proteins. In this way, CHOP dissected more than two thirds of all proteins from 62 proteomes. Analysis of our structural domain‐like fragments revealed four surprising results. First, >70% of all dissected proteins contained more than one fragment. Second, most domains spanned on average over ∼100 residues. This average was similar for eukaryotic and prokaryotic proteins, and it is also valid—although previously not described—for all proteins in the PDB. Third, single‐domain proteins were significant longer than most domains in multidomain proteins. Fourth, three fourths of all domains appeared shorter than 210 residues. We believe that our CHOP fragments constituted an important resource for functional and structural genomics. Nevertheless, our main motivation to develop CHOP was that the single‐linkage clustering method failed to adequately group full‐length proteins. In contrast, CLUP—the simple clustering scheme CLUP introduced here—succeeded largely to group the CHOP fragments from 62 proteomes such that all members of one cluster shared a basic structural core. CLUP found >63,000 multi‐ and >118,000 single‐member clusters. Although most fragments were restricted to a particular cluster, ∼24% of the fragments were duplicated in at least two clusters. Our thresholds for grouping two fragments into the same cluster were rather conservative. Nevertheless, our results suggested that structural genomics initiatives have to target >30,000 fragments to at least cover the multimember clusters in 62 proteomes. Proteins 2004. © 2004 Wiley‐Liss, Inc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Evolutionary divergence and convergence in proteins.
ZUCKERKANDL, E., & PAULING, L. (1965) · Evolving Genes and Proteins · doi:10.1016/b978-1-4832-2734-4.50017-6 · Cited by 3,020
The TIGRFAMs database of protein families
Haft, D. H. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg128 · Cited by 984
Domain size distributions can predict domain boundaries
Wheelan, S. J., Marchler-Bauer, A., & Bryant, S. H. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.7.613 · Cited by 182
Cited by
The folding and evolution of multidomain proteins
Han, J.-H., Batey, S., Nickson, A. A., Teichmann, S. A., & Clarke, J. (2007) · Nature Reviews Molecular Cell Biology · doi:10.1038/nrm2144 · Cited by 411
PROTEIN FAMILIES AND THEIR EVOLUTION—A STRUCTURAL PERSPECTIVE
Orengo, C. A., & Thornton, J. M. (2005) · Annual Review of Biochemistry · doi:10.1146/annurev.biochem.74.082803.133029 · Cited by 322
Embeddings from protein language models predict conservation and variant effects
(2021) · doi:10.1007/s00439-021-02411-y · Cited by 174
Robotic cloning and protein production platform of the northeast structural genomics consortium
Acton, T. B., Gunsalus, K. C., Xiao, R., Ma, L. C., Aramini, J., Baran, M. C., Chiang, Y.-W., Climent, T., Cooper, B., Denissova, N. G., et al. (2005) · Methods in Enzymology · doi:10.1016/s0076-6879(05)94008-1 · Cited by 129
Protein embeddings and deep learning predict binding residues for various ligand classes
(2021) · doi:10.1038/s41598-021-03431-4 · Cited by 120
Why do eukaryotic proteins contain more intrinsically disordered regions?
Basile, W., Salvatore, M., Bassot, C., & Elofsson, A. (2019) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1007186 · Cited by 113
Contrastive learning on protein embeddings enlightens midnight zone
(2022) · doi:10.1093/nargab/lqac043 · Cited by 105
Novel machine learning approaches revolutionize protein knowledge
Bordin, N., Dallago, C., Heinzinger, M., Kim, S., Littmann, M., Rauer, C., Steinegger, M., Rost, B., & Orengo, C. (2023) · Trends in Biochemical Sciences · doi:10.1016/j.tibs.2022.11.001 · Cited by 72
“Most proteins comprise two or more structural domains [2], that is, constituents with compact structures assumed to fold largely independently.”
BackgroundSelf-citation
Metadata
- Authors
- Liu, J., & Rost, B.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2004-04
- Volume
- 55
- Issue
- 3
- Pages
- 678-688
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2137736270
- Cited by
- 73
- References
- 3
- FWCI
- 3.17
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.