Search bioRxiv⌕ Search

Biology subjects

Tatka, L.

Publications and source records attributed to Tatka, L..

2 recordsLinked to original sources

Structure-free, site-resolved contrastive learningextends small-molecule discovery beyond the reachof structure-based modeling

Virtual screening asks which molecules, among an enormous space of drug-like chemistry, are worth synthesizing and testing against a protein target. Most modern methods answer by building and scoring an explicit three-dimensional pose through molecular docking, or the co-folding models that now approach experimental accuracy. Building these poses presumes a well-defined pocket, and the non-orthosteric, cryptic, and intrinsically disordered sites where unexplored ligandability lies offer none. There, these methods fail to generalize. Here we present Ptarmigan-1, a contrastive model that co-embeds the residues of a protein with candidate small molecules in a shared latent space, from sequence and two-dimensional chemistry alone, and without ever constructing a pose. Engagement reduces to the proximity of precomputed embeddings. Freed from the pose, Ptarmigan-1 trains directly on chemoproteomic and bioactivity data of mixed resolution, scores a compound in ten milliseconds rather than the tens of seconds a co-folding model demands, and resolves each prediction to the residues a compound engages. On well-folded, orthosteric targets it performs comparably to a collection of co-folding and docking models, and on covalent, cryptic, and disordered sites it matches or exceeds them. It localizes reversible and covalent inhibitors to the pockets they engage, even for targets withheld from training, and screens the entire human proteome against a library of 3.4 billion compounds in under a day. By decoupling molecular recognition from structure, Ptarmigan-1 recasts virtual screening as a reusable index that continuously improves as data accumulate.

molecular biology↗

Speciated evolution of oscillatory mass-action chemical reaction networks

Evolutionary algorithms, a class of optimization techniques inspired by biological evolution, have emerged as powerful tools for the optimization of complex systems, including the evolution of mass-action chemical reaction networks. This work explores the application of evolutionary algorithms in this domain, presenting a novel approach inspired by neural network evolution methodologies. A key feature of the algorithm is speciation, which separates candidate reaction networks into groups based on their similarity, which maintains diversity and protects innovations. Crossover has also been shown to be an effective means of improving evolutionary success in other domains. However, crossover of mass-action networks is tested and found to be detrimental to the evolutionary process. This work goes beyond theoretical exploration by offering a practical contribution in the form of a user-friendly software module. This module encapsulates the newly devised algorithm, enabling researchers and practitioners to readily apply the speciation-based approach in their own investigations of mass-action chemical reaction networks. Author summaryEvolutionary algorithms are an optimization technique inspired by biological evolution. They can be used to solve complex multi-dimensional problems for which analytic solutions are infeasible. We developed a novel evolutionary algorithm for use with mass-action chemical reaction networks. This algorithm implements two features of biological evolution, speciation and crossover, in an effort to generate chemical reaction networks with specific behaviors. Here, this novel algorithm is demonstrated by generating chemical reaction networks whose chemical species oscillate in time. This algorithm is encapsulated in a julia package and is publicly available as ReactionNetworkEvolution.jl.

systems biology↗