ArticlePloS one2018
Assigning crystallographic electron densities with free energy calculations-The case of the fluoride channel Fluc.
Article in PloS one, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.
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.
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.
Who cites it
4 citing papers in PubMed.
- Asymmetry-induced distinct mechanisms and the transporting role of sodium in bacterial fluoride channel Fluc.bioRxiv : the preprint server for biology · 2026Article
- Alchemical Free Energy Calculations on Membrane-Associated Proteins.Journal of chemical theory and computation · 2023Review
- Fluoride permeation mechanism of the Fluc channel in liposomes revealed by solid-state NMR.Science advances · 2023Article
- Ion permeation, selectivity, and electronic polarization in fluoride channels.Biophysical journal · 2022Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Approximately 90% of the structures in the Protein Data Bank (PDB) were obtained by X-ray crystallography or electron microscopy. Whereas the overall quality of structure is considered high, thanks to a wide range of tools for structure validation, uncertainties may arise from density maps of small molecules, such as organic ligands, ions or water, which are non-covalently bound to the biomolecules. Even with some experience and chemical intuition, the assignment of such disconnected electron densities is often far from obvious. In this study, we suggest the use of molecular dynamics (MD) simulations and free energy calculations, which are well-established computational methods, to aid in the assignment of ambiguous disconnected electron densities. Specifically, estimates of (i) relative binding affinities, for instance between an ion and water, (ii) absolute binding free energies, i.e., free energies for transferring a solute from bulk solvent to a binding site, and (iii) stability assessments during equilibrium simulations may reveal the most plausible assignments. We illustrate this strategy using the crystal structure of the fluoride specific channel (Fluc), which contains five disconnected electron densities previously interpreted as four fluoride and one sodium ion. The simulations support the assignment of the sodium ion. In contrast, calculations of relative and absolute binding free energies as well as stability assessments during free MD simulations suggest that four of the densities represent water molecules instead of fluoride. The assignment of water is compatible with the loss of these densities in the non-conductive F82I/F85I mutant of Fluc. We critically discuss the role of the ion force fields for the calculations presented here. Overall, these findings indicate that MD simulations and free energy calculations are helpful tools for modeling water and ions into crystallographic density maps.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.