Jump to content

Draft:Sparrow (algorithm)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Newspaperman (talk | contribs) at 04:18, 20 July 2024 (I was reading up on this topic and thought this new algorithm would be a good addition to Wikipedia. I've started the stub and labeled it as such. Included the original paper (no paywall) and an MIT news article. I added it to disambiguation page of "sparrow" as well.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Sparrow (Synthesis Planning and Rewards-based Route Optimization Workflow) is an algorithm developed by researchers at the Massachusetts Institute of Technology to streamline drug discovery. The algorithmic framework selects the best subset of molecular candidates that meet the user's criteria and minimizes costs associated with compound synthesis.[1] It is thought to have potential applications in various fields of chemical research, including the invention of new agrochemicals or specialized materials for organic electronics.[2]

References

  1. ^ "An algorithmic framework for synthetic cost-aware decision making in molecular design". arxiv.org. Retrieved 2024-07-20.
  2. ^ "A smarter way to streamline drug discovery". MIT News | Massachusetts Institute of Technology. 2024-06-17. Retrieved 2024-07-20.