PubMed Health⌕ Search

PubMed · 15229891

Molecular determinants of thapsigargin binding by SERCA Ca2+-ATPase: a computational docking study.

Abstract

Thapsigargin (TG) is a potent and commonly used inhibitor of the ion transport activity of sarco/endoplasmic reticulum Ca2+-ATPases (SERCA). Based on the recently published crystal structures of rabbit muscle SERCA1a in the Ca2+/E1 (E1) and TG/E2 (E2) conformations, we performed computational docking studies to characterize the molecular interactions that govern binding of TG and TG-analogs by the enzyme. Using the program GOLD (genetic optimization for ligand docking) in combination with the scoring function ChemScore, TG was docked into the binding site of the E1 and E2 conformations of SERCA1a. The docking results revealed a consensus ligand-binding mode consistent with the crystal structure and showed that hydrophobic interactions are the primary driving force of TG binding by SERCA. Moreover, it was shown that the conformational changes accompanying the E2 to E1 transition in the enzyme likely displace TG from its favored orientation in the binding site, thereby substantially reducing its binding affinity. This finding illustrates on the molecular level how TG may exert its inhibitory effect in binding tightly to the E2 form and preventing it from converting into its E1 form, a requirement for catalytic function. We also docked 9 TG analogs into the E2 conformation of the enzyme. Eight of the analogs adopted a binding mode very similar to that of TG, whereas one compound preferred a different orientation in the binding site. Analysis of the predicted binding affinities showed a good correlation with the experimentally observed inhibitory potencies of the analogs. Docking was also performed with several modeled mutants of SERCA1a, whose phenylalanine residue in position 256 (Phe256) had been modified. The experimentally observed declines in TG sensitivity in most of the Phe256 mutants was qualitatively accounted for and appears, at least in part, be due to a slightly altered TG-binding mode.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefan Paula, William James Ball. 2004-08-15. Molecular determinants of thapsigargin binding by SERCA Ca2+-ATPase: a computational docking study.. https://doi.org/10.1002/prot.20105

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗