PubMed Health⌕ Search

PubMed · 11217918

Comparative molecular field analysis (coMFA) study of epothilones-tubulin depolymerization inhibitors: pharmacophore development using 3D QSAR methods.

Abstract

A three-dimensional quantitative structure-activity relationship (3D QSAR) study has been carried out on epothilones based on comparative molecular field analyses (CoMFA) using a large data set of epothilone analogs, which are potent inhibitors of tubulin depolymerization. Microtubules, which are polymers of the a/beta-tubulin heterodimer, need to dissociate in order to form the mitotic spindle, a structure required for cell division. A rational pharmacophore searching method using 3D QSAR procedures was carried out and the results for the epothilones are described herein. One-hundred and sixty-six epothilone analogs and their depolymerization inhibition properties with tubulin were used as a training set. Over a thousand molecular field energies were generated and applied to generate the descriptors of QSAR equations. Using a genetic function algorithm (GFA) method, combined with a least square approach, multiple QSAR models were considered during the search for pharmacophore elements. Each GFA run resulted in 100 QSAR models, which were ranked according to their lack of fit (LOF) scores, with a total of 40 GFA runs having been performed. The 40 best QSAR equations from each run had adequate fitted correlation coefficients (R from 0.813 to 0.863) and were of sufficient statistical significance (F value from 7.2 to 10.9). The pharmacophore elements for epothilones were studied by investigating the hit frequency of descriptors (i.e. the sampling probabilities of grid points from the GFA studies) from the set of the 4,000 top scoring QSAR equations. By comparing the frequency with which each grid point appeared in the QSAR equations, three candidate regions in the epothilones were proposed to be pharmacophore elements. Two of them are completely compatible with the recent model proposed by Ojima et al. [Proc. Natl. Acad. Sci. USA, 96 (1999) 4256], however, one is quite different and is necessary to accurately predict the activities of all 166 epothilone molecules used in our training set. Finally, by visualizing the 35 most probable grid points, it was found that changes related to the C6, C7, C8, C 12, S20, and C21 atoms of the epothilones were highly correlated to their activity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

K W Lee, J M Briggs. 2001. Comparative molecular field analysis (coMFA) study of epothilones-tubulin depolymerization inhibitors: pharmacophore development using 3D QSAR methods.. https://doi.org/10.1023/a%3A1011140723828

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↗