PubMed Health⌕ Search

PubMed · 11099639

A computationally based identification algorithm for estrogen receptor ligands: part 2. Evaluation of a hERalpha binding affinity model.

Abstract

The objective of this study was to evaluate the capability of an expert system described in the previous paper (S. Bradbury et al., Toxicol. Sci. 58, 253-269) to identify the potential for chemicals to act as ligands of mammalian estrogen receptors (ERs). The basis of the expert system was a structure activity relationship (SAR) model, based on relative binding affinity (RBA) values for steroidal and nonsteroidal chemicals derived from human ERalpha (hERalpha) competitive binding assays. The expert system enables categorization of chemicals into (RBA ranges of < 0.1, 0.1 to 1, 1 to 10, 10 to 100, and >150% relative to 17ss-estradiol. In the current analysis, the algorithm was evaluated with respect to predicting RBAs of chemicals assayed with ERs from MCF7 cells, and mouse and rat uterine preparations. The best correspondence between predicted and observed RBA ranges was obtained with MCF7 cells. The agreement between predictions from the expert system and data from binding assays with mouse and rat ER(s) were less reliable, especially for chemicals with RBAs less than 10%. Prediction errors often were false positives, i.e., predictions of greater than observed RBA values. While discrepancies were likely due, in part, to species-specific variations in ER structure and ligand binding affinity, a systematic bias in structural characteristics of chemicals in the hERalpha training set, compared to the rodent evaluation data sets, also contributed to prediction errors. False-positive predictions were typically associated with ligands that had shielded electronegative sites. Ligands with these structural characteristics were not well represented in the training set used to derive the expert system. Inclusion of a shielding criterion into the original expert system significantly increased the accuracy of RBA predictions. With this additional structural requirement, 38 of 46 compounds with measured RBA values greater than 10% in hERalpha, MCF7, and rodent uterine preparations were correctly categorized. Of the remaining 129 compounds in the combined data sets, RBA values for 65 compounds were correctly predicted, with 47 of the incorrect predictions being false positives. Based upon this exploratory analysis, the modeling approach, combined with a high-quality training set of RBA values derived from a diverse set of chemical structures, could provide a credible tool for prioritizing chemicals with moderate to high ER binding affinity for subsequent in vitro or in vivo assessments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

O G Mekenyan, V Kamenska, P K Schmieder, G T Ankley, S P Bradbury. 2000. A computationally based identification algorithm for estrogen receptor ligands: part 2. Evaluation of a hERalpha binding affinity model.. https://doi.org/10.1093/toxsci%2F58.2.270

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&#xd7; to 17.6&#xd7; faster than POASTA, and 7.3&#xd7; 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&#xd7; to 16.9&#xd7; speedup on short reads. Moreover, Theseus is 1.5&#xd7; to 36.3&#xd7; 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↗