The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Weighted Implementation of Suboptimal Paths (WISP): An Optimized Algorithm and Tool for Dynamical Network Analysis
Open accessAbstract
Abstract Allostery can occur by way of subtle cooperation among protein residues (e.g., amino acids) even in the absence of large conformational shifts. Dynamical network analysis has been used to model this cooperation, helping to computationally explain how binding to an allosteric site can impact the behavior of a primary site many ångstroms away. Traditionally, computational efforts have focused on the most optimal path of correlated motions leading from the allosteric to the primary active site. We present a program called Weighted Implementation of Suboptimal Paths (WISP) capable of rapidly identifying additional suboptimal pathways that may also play important roles in the transmission of allosteric signals. Aside from providing signal redundancy, suboptimal paths traverse residues that, if disrupted through pharmacological or mutational means, could modulate the allosteric regulation of important drug targets. To demonstrate the utility of our program, we present a case study describing the allostery of HisH-HisF, an amidotransferase from T. maritima thermotiga. WISP and its VMD-based graphical user interface (GUI) can be downloaded from http://nbcr.ucsd.edu/wisp.
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
Scalable molecular dynamics with NAMD
Phillips, J. C., Braun, R., Wang, W., Gumbart, J., Tajkhorshid, E., Villa, E., Chipot, C., Skeel, R. D., Kalé, L., & Schulten, K. (2005) · Journal of Computational Chemistry · doi:10.1002/jcc.20289 · Cited by 16,914
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477
Cited by
The Bio3D packages for structural bioinformatics
Grant, B. J., Skjærven, L., & Yao, X. (2021) · Protein Science · doi:10.1002/pro.3923 · Cited by 462
The role of protein dynamics in the evolution of new enzyme function
Campbell, E., Kaltenbach, M., Correy, G. J., Carr, P. D., Porebski, B. T., Livingstone, E. K., Afriat-Jurnou, L., Buckle, A. M., Weik, M., Hollfelder, F., et al. (2016) · Nature Chemical Biology · doi:10.1038/nchembio.2175 · Cited by 311
Allostery without a conformational change? Revisiting the paradigm
Nussinov, R., & Tsai, C.-J. (2015) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2014.11.005 · Cited by 202
Revealing Atomic-Level Mechanisms of Protein Allostery with Molecular Dynamics Simulations
Hertig, S., Latorraca, N. R., & Dror, R. O. (2016) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004746 · Cited by 118
Recent computational advances in the identification of allosteric sites in proteins
Lu, S., Huang, W., & Zhang, J. (2014) · Drug Discovery Today · doi:10.1016/j.drudis.2014.07.012 · Cited by 102
Metadata
- Authors
- Van Wart, A. T., Durrant, J., Votapka, L., & Amaro, R. E.
- Venue
- Journal of Chemical Theory and Computation
- Publisher
- American Chemical Society (ACS)
- Published
- 2014-01-31
- Volume
- 10
- Issue
- 2
- Pages
- 511-517
- ISSN
- 1549-9618 (ISSN-L)
- 1549-9626
- OpenAlex
- W2324848479
- Cited by
- 183
- References
- 2
- FWCI
- 4.38
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Weighted Implementation of Suboptimal Paths (WISP): An Optimized Algorithm and Tool for Dynamical Network Analysis. https://app.cochat.ai/papers/10.1021/ct4008603
- The paper
- Van Wart, A. T., Durrant, J., Votapka, L., & Amaro, R. E. (2014). Weighted Implementation of Suboptimal Paths (WISP): An Optimized Algorithm and Tool for Dynamical Network Analysis. Journal of Chemical Theory and Computation. https://doi.org/10.1021/ct4008603
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.