Navigating Large Chemical Spaces Using Graph Theory and Integer Programming
Ugochukwu M. Ikegwu, Reid C. Van Lehn, Victor M. Zavala · 2026
Read Navigating Large Chemical Spaces Using Graph Theory and Integer Programming by Ugochukwu M. Ikegwu, Reid C. Van Lehn, Victor M. Zavala (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-13625972.txt.
Description
Ugochukwu Ikegwu, Reid Van Lehn, and Victor Zavala set out a frame to move through large sets of chem forms with graph math and whole-count plans. Their 2026 study aims to speed design and find of new bits and new ways to make goods.
Each bit in a set is a node in a graph. Links join nodes by how alike they are or by links drawn from field know-how. The team picks lead bits by work on the least lead set. That set is the least set that links to all the rest. Fast guess ways and strict plan ways solve it. The frame holds traits of the bits and field rules while it picks its marks. The team showed it on near fifteen thousand forms of one fluor-linked group. They set it next to shrink and group ways such as t-SNE and k-means.
Catalog record
| CREATOR | Ugochukwu M. Ikegwu, Reid C. Van Lehn, Victor M. Zavala |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 91 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |