Nov 2025· Nucleic Acids Research· Vol 54, pp. D1469 - D1476· 6 citations· 25 references
Medicine
TL;DR
Macrocycle-DB is presented, the most extensive online database dedicated to macrocycles, featuring 45 525 compounds, including 76 approved drugs and 105 clinical candidates that target 2533 proteins.
Abstract
Abstract Macrocycles have gained significant attention in drug design owing to their distinctive structural and physicochemical features. Despite the abundance of available experimental data, there remains a need for a centralized resource to support macrocycle-based drug discovery. Here, we present Macrocycle-DB, the most extensive online database dedicated to macrocycles, featuring 45 525 compounds, including 76 approved drugs and 105 clinical candidates that target 2533 proteins. The database offers comprehensive structural information, experimental bioactivity data, and physicochemical properties for each macrocycle, along with co-crystal structures to visualize protein–ligand interactions. Additionally, Macrocycle-DB provides specialized descriptors, scaffold and linker details for synthetic macrocycles, and high-quality downloadable datasets to facilitate computational drug design. Macrocycle-DB is freely accessible at https://macro-db.dpbio.tech/ and https://macro-db.cn/.
Natural cyclic peptides have long served as a rich reservoir of bioactivity, occupying a unique region of the drug space that bridges the gap between small molecules and large biologics, and researchers are rationally engineering next-generation macrocycles, positioning them at the frontier of modern drug development.
Greta Bergamaschi, Giulia Lodigiani, Stefano Gandolfi et al.· Current Opinion in Chemical...· 0 citations
Findings validate the diphenylpyrazine scaffold as a promising chemotype for Skp2–Cks1 inhibition and identify C3 as a strong lead for further optimization.
Emadeldin M. Kamel, A. A. Allam, H. Rudayni et al.· Journal of Computer-Aided Mo...· 0 citations
FlexAutoDock is an automated cloud-based molecular docking platform that provides a unified environment for protein-ligand docking and large-scale virtual screening, providing researchers with an accessible computational resource for accelerating early-stage drug discovery.
Md. Feroj Ahmed, M. Faysal, Khalid Muntasir Sawad et al.· bioRxiv· 0 citations
A structural database that systematically maps the complete activation trajectories of pharmaceutically relevant targets, encompassing TS, IS, and all connecting conformational ensembles is presented, offering multiple strategic advantages for drug discovery.
This Data Descriptor presents a large-scale molecular descriptor dataset comprising 33,715 small molecules, specifically curated for high-throughput screening and drug delivery strategy optimization. Addressing the limitations of traditional descriptors in characterizing complex molecular geometry, we provide advanced...
Alexandra Farcaș, L. Jäntschi· Scientific Data· 1 citation
This review critically summarizes and discusses the progress made in the design, synthesis, and anticancer evaluation of triazolopyrimidine-based organic and inorganic scaffolds reported in the scientific literature over the past five years, with an emphasis on their mechanisms of action and future therapeutic prospect...
I. Lumb, Jaskirat Singh, Yukta Soni et al.· Mini-Reviews in Medical Chem...· 0 citations
Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity. The post What AI gets wrong and what failure teaches us appeared first on Microsoft Research.
Microsoft Research Blog· microsoft.comOct 21, 2026
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026