Remote homology search with hidden Potts models
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Most methods for biological sequence homology search and alignment work with primary sequence alone, neglecting higher-order correlations. Recently, statistical physics models called Potts models have been used to infer all-by-all pairwise correlations between sites in deep multiple sequence alignments, and these pairwise couplings have improved 3D structure predictions. Here we extend the use of Potts models from structure prediction to sequence alignment and homology search by developing what we call a hidden Potts model (HPM) that merges a Potts emission process to a generative probability model of insertion and deletion. Because an HPM is incompatible with efficient dynamic programming alignment algorithms, we develop an approximate algorithm based on importance sampling, using simpler probabilistic models as proposal distributions. We test an HPM implementation on RNA structure homology search benchmarks, where we can compare directly to exact alignment methods that capture nested RNA base-pairing correlations (stochastic context-free grammars). HPMs perform promisingly in these proof of principle experiments.
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
Morcos, F., Pagnani, A., Lunt, B., Bertolino, A., Marks, D. S., Sander, C., Zecchina, R., Onuchic, J. N., Hwa, T., & Weigt, M. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1111471108 · Cited by 1,434
Simulation of biological cell sorting using a two-dimensional extended Potts model
Graner, F., & Glazier, J. A. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2013 · Cited by 1,377
Mutation effects predicted from sequence co-variation
Hopf, T. A., Ingraham, J. B., Poelwijk, F. J., Schärfe, C. P. I., Springer, M., Sander, C., & Marks, D. S. (2017) · Nature Biotechnology · doi:10.1038/nbt.3769 · Cited by 775
Improved contact prediction in proteins: using pseudolikelihoods to infer Potts models
Ekeberg, M., Lövkvist, C., Lan, Y., Weigt, M., & Aurell, E. (2013) · Physical Review E · doi:10.1103/physreve.87.012707 · Cited by 661
Ovchinnikov, S., Kamisetty, H., & Baker, D. (2014) · eLife · doi:10.7554/elife.02030 · Cited by 629
Protein interaction networks revealed by proteome coevolution
Cong, Q., Anishchenko, I., Ovchinnikov, S., & Baker, D. (2019) · Science · doi:10.1126/science.aaw6718 · Cited by 241
3D RNA and Functional Interactions from Evolutionary Couplings
Weinreb, C., Riesselman, A. J., Ingraham, J. B., Gross, T., Sander, C., & Marks, D. S. (2016) · Cell · doi:10.1016/j.cell.2016.03.030 · Cited by 159
Graphical Models of Residue Coupling in Protein Families
Thomas, J., Ramakrishnan, N., & Bailey-Kellogg, C. (2008) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2007.70225 · Cited by 77
Cited by
Statistical Mechanics: Theory and Molecular Simulation
Tuckerman, M. E. (2023) · doi:10.1093/oso/9780198825562.001.0001 · Cited by 973
From sequence to function through structure: Deep learning for protein design
(2022) · doi:10.1016/j.csbj.2022.11.014 · Cited by 124
End-to-end learning of multiple sequence alignments with differentiable Smith–Waterman
Petti, S., Bhattacharya, N., Rao, R., Dauparas, J., Thomas, N., Zhou, J., Rush, A. M., Koo, P., & Ovchinnikov, S. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btac724 · Cited by 54
Exploring a diverse world of effector domains and amyloid signaling motifs in fungal NLR proteins
Wojciechowski, J. W., Tekoglu, E., Gąsior-Głogowska, M., Coustou, V., Szulc, N., Szefczyk, M., Kopaczyńska, M., Saupe, S. J., & Dyrka, W. (2022) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1010787 · Cited by 19
Metadata
- Authors
- Wilburn, G. W., & Eddy, S. R.
- Venue
- PLOS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2020-11-30
- Volume
- 16
- Issue
- 11
- Pages
- e1008085
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W3107611715
- Cited by
- 56
- References
- 8
- FWCI
- 3.39
- Type
- journal article
- Language
- en
- Open access
- gold
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: Remote homology search with hidden Potts models. https://app.cochat.ai/papers/10.1371/journal.pcbi.1008085
- The paper
- Wilburn, G. W., & Eddy, S. R. (2020). Remote homology search with hidden Potts models. PLOS Computational Biology. https://doi.org/10.1371/journal.pcbi.1008085
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.