A comprehensive review and comparison of different computational methods for protein remote homology detection
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Protein remote homology detection is one of the most fundamental and central problems for the studies of protein structures and functions, aiming to detect the distantly evolutionary relationships among proteins via computational methods. During the past decades, many computational approaches have been proposed to solve this important task. These methods have made a substantial contribution to protein remote homology detection. Therefore, it is necessary to give a comprehensive review and comparison on these computational methods. In this article, we divide these computational approaches into three categories, including alignment methods, discriminative methods and ranking methods. Their advantages and disadvantages are discussed in a comprehensive perspective, and their performance is compared on widely used benchmark data sets. Finally, some open questions in this field are further explored and discussed.
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
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288 · cited 1×
“In these methods, the sequence alignments between two sequences are calculated by using dynamic programming algorithms, such as global alignment (Needleman–Wunsch) [25] and LA (Smith– Waterman) [26].”
HHblits: lightning-fast iterative protein sequence searching by HMM-HMM alignment
Remmert, M., Biegert, A., Hauser, A., & Söding, J. (2012) · Nature Methods · doi:10.1038/nmeth.1818 · Cited by 2,288
A draft map of the human proteome
Kim, M.-S., Pinto, S. M., Getnet, D., Nirujogi, R. S., Manda, S. S., Chaerkady, R., Madugundu, A. K., Kelkar, D. S., Isserlin, R., Jain, S., et al. (2014) · Nature · doi:10.1038/nature13302 · Cited by 2,198
Twilight zone of protein sequence alignments
Rost, B. (1999) · Protein Engineering, Design and Selection · doi:10.1093/protein/12.2.85 · Cited by 1,833
UniRef: comprehensive and non-redundant UniProt reference clusters
Suzek, B. E., Huang, H., McGarvey, P., Mazumder, R., & Wu, C. H. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm098 · Cited by 1,613
Profile analysis: detection of distantly related proteins.
Gribskov, M., McLachlan, A. D., & Eisenberg, D. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.13.4355 · Cited by 1,325
Cited by
Sun, Z., Liu, Q., Qu, G., Feng, Y., & Reetz, M. T. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00290 · Cited by 526
Chen, Z., Zhao, P., Li, F., Marquez-Lago, T. T., Leier, A., Revote, J., Zhu, Y., Powell, D. R., Akutsu, T., Webb, G. I., et al. (2020) · Briefings in Bioinformatics · doi:10.1093/bib/bbz041 · Cited by 417
Liu, B., Gao, X., & Zhang, H. (2019) · Nucleic Acids Research · doi:10.1093/nar/gkz740 · Cited by 409
Self-citationLiu, B. (2019) · Briefings in Bioinformatics · doi:10.1093/bib/bbx165 · Cited by 322
Self-citationChen, Z., Zhao, P., Li, C., Li, F., Xiang, D., Chen, Y.-Z., Akutsu, T., Daly, R. J., Webb, G. I., Zhao, Q., et al. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkab122 · Cited by 277
Metadata
- Authors
- Chen, J., Guo, M., Wang, X., & Liu, B.
- Venue
- Briefings in Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2016-11-13
- Volume
- 19
- Issue
- 2
- Pages
- 231-244
- ISSN
- 1467-5463 (ISSN-L)
- 1477-4054
- OpenAlex
- W2550969987
- Cited by
- 144
- References
- 6
- FWCI
- 8.73
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A comprehensive review and comparison of different computational methods for protein remote homology detection. https://app.cochat.ai/papers/10.1093/bib/bbw108
- The paper
- Chen, J., Guo, M., Wang, X., & Liu, B. (2018). A comprehensive review and comparison of different computational methods for protein remote homology detection. Briefings in Bioinformatics. https://doi.org/10.1093/bib/bbw108
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.