Evidence map›Paper›PMID 34029314›Full record

ArticlePLoS computational biology2021

Evaluation of residue-residue contact prediction methods: From retrospective to prospective.

Huiling Zhang, Zhendong Bei, Wenhui Xi, Min Hao, Zhen Ju, Konda Mani Saravanan, Haiping Zhang, Ning Guo, Yanjie Wei

Open access · goldAbstract read
In one paragraph

Article in PLoS computational biology, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing papers in PubMed
2.4field-weighted citation impact, top 10% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

13 citing papers in PubMed, 33 citations in OpenAlex.

  1. Review
  2. Article
  3. Review
  4. Article
  5. Review
  6. Article
  7. Article
  8. Computational prediction of disordered binding regions.Computational and structural biotechnology journal · 2023
    Review
  9. Article
  10. Towards Molecular Understanding of the Functional Role of UbiJ-UbiKInternational journal of molecular sciences · 2022
    Article
  11. Article
  12. Article
  13. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

9 authors at 3 institutions in 1 country.

Huiling ZhangUniversity of Chinese Academy of Sciences, Beijing, China.ORCID 0000-0002-7856-2703
Zhendong BeiCloud Computing Department, Alibaba Group, Hangzhou, China.
Wenhui XiCentre for High Performance Computing, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China.ORCID 0000-0003-4272-7518
Min HaoCollege of Electronic and Information Engineering, Southwest University, Chongqing, China.ORCID 0000-0001-5696-7745
Zhen JuUniversity of Chinese Academy of Sciences, Beijing, China.ORCID 0000-0001-7720-1570
Konda Mani SaravananCentre for High Performance Computing, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China.ORCID 0000-0002-5541-234X
Haiping ZhangCentre for High Performance Computing, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China.ORCID 0000-0003-2133-1768
Ning GuoCentre for High Performance Computing, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China.ORCID 0000-0003-3434-3717
Yanjie WeiUniversity of Chinese Academy of Sciences, Beijing, China.
Chinese Academy of Sciences · CNAlibaba Group (China) · CNSouthwest University · CN

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Sequence-based residue contact prediction plays a crucial role in protein structure reconstruction. In recent years, the combination of evolutionary coupling analysis (ECA) and deep learning (DL) techniques has made tremendous progress for residue contact prediction, thus a comprehensive assessment of current methods based on a large-scale benchmark data set is very needed. In this study, we evaluate 18 contact predictors on 610 non-redundant proteins and 32 CASP13 targets according to a wide range of perspectives. The results show that different methods have different application scenarios: (1) DL methods based on multi-categories of inputs and large training sets are the best choices for low-contact-density proteins such as the intrinsically disordered ones and proteins with shallow multi-sequence alignments (MSAs). (2) With at least 5L (L is sequence length) effective sequences in the MSA, all the methods show the best performance, and methods that rely only on MSA as input can reach comparable achievements as methods that adopt multi-source inputs. (3) For top L/5 and L/2 predictions, DL methods can predict more hydrophobic interactions while ECA methods predict more salt bridges and disulfide bonds. (4) ECA methods can detect more secondary structure interactions, while DL methods can accurately excavate more contact patterns and prune isolated false positives. In general, multi-input DL methods with large training sets dominate current approaches with the best overall performance. Despite the great success of current DL methods must be stated the fact that there is still much room left for further improvement: (1) With shallow MSAs, the performance will be greatly affected. (2) Current methods show lower precisions for inter-domain compared with intra-domain contact predictions, as well as very high imbalances in precisions between intra-domains. (3) Strong prediction similarities between DL methods indicating more feature types and diversified models need to be developed. (4) The runtime of most methods can be further optimized.

Indexed as

Amino Acid SequenceComputational BiologyDatasets as TopicDeep LearningProspective StudiesProteinsRetrospective StudiesProteins

Identifiers

PMID34029314
PMCPMC8177648
OpenAlexW3164039183

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.