Preprint—not peer reviewed
Didi, K., Reidenbach, D., Penner, M., Ravichandran, S., Case, M., Nichols, M., Swanson, E., Reis, A., Prescott, M., Qian, Y., Qian, D., Yang, J., Li, W., Li, L., Shonai, D., Gay, S., Basu Mallik, B., Chim, H. Y., Chen, L., Atienza Juanatey, M., Klein, H., Rieger, D., Schlegel, P., Macintyre, A. U., Secor, M., Granata, D., Cha, S., Cao, Z., Zhou, G., Geffner, T., Chen, X., Livne, M., Zhang, Z., Zhang, T., Gion, K., Bronstein, M. M., Steinegger, M., Deibler, K., Soderling, S., Schoeder, C. T., Khmelinskaia, A., Hollfelder, F., Dallago, C., Kucukbenli, E., Vahdat, A., Ogden, P., Kreis, K.
The authors introduce a latent generative search framework that applies reward-guided inference-time search to steer Proteina-Complexa. They report more validated binders than other tested methods in a multiplexed phage-display screen exceeding a million designs. The authors suggest the approach can reach polar, flexible targets that have resisted previous de novo binder methods.
AI–biochemistry Biomolecular designGenerative design