CoChat

LOMETS2: improved meta-threading server for fold-recognition and structure-based function annotation for distant-homology proteins

Open access
Zheng, Wei, Zhang, Chengxin, Wuyun, Qiqige, Pearce, Robin, Li, Yang, Zhang, Yang · 2019 · Nucleic Acids Research
Cited by 136

The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.

Abstract

The LOMETS2 server (https://zhanglab.ccmb.med.umich.edu/LOMETS/) is an online meta-threading server system for template-based protein structure prediction. Although the server has been widely used by the community over the last decade, the previous LOMETS server no longer represents the state-of-the-art due to aging of the algorithms and unsatisfactory performance on distant-homology template identification. An extension of the server built on cutting-edge methods, especially techniques developed since the recent CASP experiments, is urgently needed. In this work, we report the recent advancements of the LOMETS2 server, which comprise a number of major new developments, including (i) new state-of-the-art threading programs, including contact-map-based threading approaches, (ii) deep sequence search-based sequence profile construction and (iii) a new web interface design that incorporates structure-based function annotations. Large-scale benchmark tests demonstrated that the integration of the deep profiles and new threading approaches into LOMETS2 significantly improve its structure modeling quality and template detection, where LOMETS2 detected 176% more templates with TM-scores >0.5 than the previous LOMETS server for Hard targets that lacked homologous templates. Meanwhile, the newly incorporated structure-based function prediction helps extend the usefulness of the online server to the broader biological community.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/nar/gkz384

Cites

11 of 11 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 27

  1. Dunbrack, 2014, 11th Community Wide Experiment on the Critical Assessment of Techniques for Protein Structure Prediction
  2. Kryshtafovych, 2018, Evaluation of the template-based modeling in CASP12, Proteins, 86, 321, 10.1002/prot.25425 · DOI · Paper page
  3. Bowie, 1994, An evolutionary approach to folding small alpha-helical proteins that uses sequence information and an empirical guiding fitness function, PNAS, 91, 4436, 10.1073/pnas.91.10.4436 · DOI · Paper page
  4. Xu, 2000, Protein threading using PROSPECT: design and evaluation, Proteins, 40, 343, 10.1002/1097-0134(20000815)40:3<343::AID-PROT10>3.0.CO;2-S · DOI · Paper page
  5. Skolnick, 2004, Development and large scale benchmark testing of the PROSPECTOR_3 threading algorithm, Proteins, 56, 502, 10.1002/prot.20106 · DOI · Paper page
  6. Yang, 2011, Improving protein fold recognition and template-based modeling by employing probabilistic-based matching between predicted one-dimensional structural properties of query and corresponding native properties of templates, Bioinformatics, 27, 2076, 10.1093/bioinformatics/btr350 · DOI · Paper page
  7. Wu, 2008, MUSTER: Improving protein sequence profile-profile alignments by using multiple sources of structure information, Proteins, 72, 547, 10.1002/prot.21945 · DOI · Paper page
  8. Xu, 2014, FFAS-3D: improving fold recognition by including optimized structural features and template re-ranking, Bioinformatics, 30, 660, 10.1093/bioinformatics/btt578 · DOI
  9. Soding, 2005, Protein homology detection by HMM-HMM comparison, Bioinformatics, 21, 951, 10.1093/bioinformatics/bti125 · DOI · Paper page
  10. Fischer, 2006, Servers for protein structure prediction, Curr. Opin. Struct. Biol., 16, 178, 10.1016/j.sbi.2006.03.004 · DOI
  11. Zhang, 2008, Progress and challenges in protein structure prediction, Curr. Opin. Struct. Biol., 18, 342, 10.1016/j.sbi.2008.02.004 · DOI · Paper page
  12. Ginalski, 2003, 3D-Jury: a simple approach to improve protein structure predictions, Bioinformatics, 19, 1015, 10.1093/bioinformatics/btg124 · DOI · Paper page
  13. Wu, 2007, LOMETS: a local meta-threading-server for protein structure prediction, Nucleic Acids Res., 35, 3375, 10.1093/nar/gkm251 · DOI · Paper page
  14. Fischer, 2003, 3D-SHOTGUN: a novel, cooperative, fold-recognition meta-predictor, Proteins, 51, 434, 10.1002/prot.10357 · DOI · Paper page
  15. Croll, 2018, Assessing template-based models
  16. Yang, 2013, BioLiP: a semi-manually curated database for biologically relevant ligand-protein interactions, Nucleic Acids Res., 41, D1096, 10.1093/nar/gks966 · DOI · Paper page
  17. Altschul, 1997, Gapped BLAST and PSI-BLAST: a new generation of protein database search programs, Nucleic Acids Res., 25, 3389, 10.1093/nar/25.17.3389 · DOI · Paper page
  18. Mirdita, 2017, Uniclust databases of clustered and deeply annotated protein sequences and alignments, Nucleic Acids Res., 45, D170, 10.1093/nar/gkw1081 · DOI · Paper page
  19. Johnson, 2010, Hidden Markov model speed heuristic and iterative HMM search procedure, BMC Bioinformatics, 11, 431, 10.1186/1471-2105-11-431 · DOI · Paper page
  20. Meier, 2015, Automatic prediction of protein 3D structures by probabilistic multi-template homology modeling, PLoS Comput. Biol., 11, e1004343, 10.1371/journal.pcbi.1004343 · DOI · Paper page
  21. Madera, 2008, Profile Comparer: a program for scoring and aligning profile hidden Markov models, Bioinformatics, 24, 2630, 10.1093/bioinformatics/btn504 · DOI · Paper page
  22. Rego, 2015, 3Dmol.js: molecular visualization with WebGL, Bioinformatics, 31, 1322, 10.1093/bioinformatics/btu829 · DOI · Paper page
  23. Moult, 2014, Critical assessment of methods of protein structure prediction (CASP)–round x, Proteins, 82, 1, 10.1002/prot.24452 · DOI · Paper page
  24. Zhu, 2018, Protein threading using residue co-variation and deep learning, Bioinformatics, 34, i263, 10.1093/bioinformatics/bty278 · DOI · Paper page
  25. Xu, 2018, Protein structure modeling by predicted distance instead of contacts, CASP13 Abstract, 146
  26. Binns, 2009, QuickGO: a web-based tool for Gene Ontology searching, Bioinformatics, 25, 3045, 10.1093/bioinformatics/btp536 · DOI · Paper page
  27. Bairoch, 2000, The ENZYME database in 2000, Nucleic Acids Res., 28, 304, 10.1093/nar/28.1.304 · DOI · Paper page

Cited by

See all 136

Metadata

Authors
Zheng, W., Zhang, C., Wuyun, Q., Pearce, R., Li, Y., & Zhang, Y.
Venue
Nucleic Acids Research
Published
2019-05-13
Volume
47
Issue
W1
Pages
W429-W436
ISSN
  • 0305-1048 (ISSN-L)
  • 1362-4962
OpenAlex
W2955330427
Cited by
136
References
11
FWCI
7.52
Type
journal article
Language
en
Open access
gold
Funders
  • National Institutes of Health (GM083107, GM116960, AI134678)
  • National Science Foundation (DBI1564756)

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.