Browse Articles

Computational development of aryl sulfone compounds as potential NNRTIs

Zhang et al. | Oct 12, 2022

Computational development of aryl sulfone compounds as potential NNRTIs

Non-nucleoside reverse transcriptase inhibitors (NNRTIs) are allosteric inhibitors that bind to the HIV reverse transcriptase and prevent replication. Indolyl aryl sulfones (IAS) and IAS derivatives have been found to be highly effective against mutant strains of HIV-1 reverse transcriptase. Here, we analyzed molecules designed using aryl sulfone scaffolds paired to cyclic compounds as potential NNRTIs through the computational design and docking of 100 novel NNRTI candidates. Moreover, we explored the specific combinations of functional groups and aryl sulfones that resulted in the NNRTI candidates with the strongest binding affinity while testing all compounds for carcinogenicity. We hypothesized that the combination of an IAS scaffold and pyrimidine would produce the compounds with the best binding affinity. Our hypothesis was correct as the series of molecules with an IAS scaffold and pyrimidine exhibited the best average binding affinity. Additionally, this study found 32 molecules designed in this procedure with higher or equal binding affinities to the previously successful IAS derivative 5-bromo-3-[(3,5-dimethylphenyl)sulfonyl]indole-2-carboxyamide when docked to HIV-1 reverse transcriptase.

Read More...

Ant Colony Optimization Algorithms with Multiple Simulated Colonies Offer Potential Advantages for Solving the Traveling Salesman Problem and, by Extension, Other Optimization Problems

Wildenhain et al. | May 22, 2015

Ant Colony Optimization Algorithms with Multiple Simulated Colonies Offer Potential Advantages for Solving the Traveling Salesman Problem and, by Extension, Other Optimization Problems

Ant colony optimization algorithms simulate ants moving from point to point on a graph and coordinate their actions, similar to ants laying down pheromones to strengthen a path as it is used more frequently. These ACO algorithms can be applied to the classic traveling salesman problem, which aims to determine the lowest-cost path through a given set of points on a graph. In this study, a novel multiple-colony system was developed that uses multiple simulated ant colonies to generate improved solutions to the traveling salesman problem.

Read More...