Presentations
Delivering Data Driven Value
How to Keep Linear Compute Scaling with Ever-Growing Data?
Ramil Nugmanov presents a fragment-based, SMILES-concatenation strategy for DNA-encoded library searches that dramatically reduces memory and compute demands while enabling fast, scalable similarity searches in billion-compound chemical spaces.
Published on: August 14, 2025