2573 Publications

Heuristic energy-based cyclic peptide design

Q. Zhu, V. Mulligan, Dennis Shasha

Rational computational design is crucial to the pursuit of novel drugs and therapeutic agents. Meso-scale cyclic peptides, which consist of 7-40 amino acid residues, are of particular interest due to their conformational rigidity, binding specificity, degradation resistance, and potential cell permeability. Because there are few natural cyclic peptides, de novo design involving non-canonical amino acids is a potentially useful goal. Here, we develop an efficient pipeline (CyclicChamp) for cyclic peptide design. After converting the cyclic constraint into an error function, we employ a variant of simulated annealing to search for low-energy peptide backbones while maintaining peptide closure. Compared to the previous random sampling approach, which was capable of sampling conformations of cyclic peptides of up to 14 residues, our method both greatly accelerates the computation speed for sampling conformations of small macrocycles (ca. 7 residues), and addresses the high-dimensionality challenge that large macrocycle designs often encounter. As a result, CyclicChamp makes conformational sampling tractable for 15-to 24-residue cyclic peptides, thus permitting the design of macrocycles in this size range. Microsecond-length molecular dynamics simulations on the resulting 15, 20, and 24 amino acid cyclic designs identify designs with kinetic stability. To test their thermodynamic stability, we perform additional replica exchange molecular dynamics simulations and generate free energy surfaces. Three 15-residue designs, one 20-residue and one 24-residue design emerge as promising candidates.

Show Abstract
March 1, 2025

CyclicCAE: A Conformational Autoencoder for Efficient Heterochiral Macrocyclic Backbone Sampling

Andrew C. Powers, D. Renfrew, Parisa Hosseinzadeh, V. Mulligan

Macrocycles are a promising therapeutic class. The incorporation of heterochiral and non-natural chemical building-blocks presents challenges for rational design, however. With no existing machine learning methods tailored for heterochiral macrocycle design, we developed a novel convolutional autoencoder model to rapidly generate energetically favorable macrocycle backbones for heterochiral design and structure prediction. Our approach surpasses the current state-of-the-art method, Generalized Kinematic loop closure (GenKIC) in the Rosetta software suite. Given the absence of large, available macrocycle datasets, we created a custom dataset in-house and in silico. Our model, CyclicCAE, produces energetically stable backbones and designable structures more rapidly than GenKIC. It enables users to perform energy minimization, generate structurally similar or diverse inputs via MCMC, and conduct inpainting with fixed anchors or motifs. We propose that this novel method will accelerate the development of stable macrocycles, speeding up macrocycle drug design pipelines.

Show Abstract
February 27, 2025

Geometric, cell cycle and maternal-to-zygotic transition-associated YAP dynamics during preimplantation embryo development

Madeleine Chalifoux, M. Avdeeva, Eszter Posfai

During the first cell fate decision in mammalian embryos the inner cell mass cells, which will give rise to the embryo proper and other extraembryonic tissues, segregate from the trophectoderm cells, the precursors of the placenta. Cell fate segregation proceeds in a gradual manner encompassing two rounds of cell division, as well as cell positional and morphological changes. While it is known that the activity of the Hippo signaling pathway and the subcellular localization of its downstream effector YAP dictate lineage specific gene expression, the response of YAP to these dynamic cellular changes remains incompletely understood. Here we address these questions by quantitative live imaging of endogenously tagged YAP while simultaneously monitoring geometric cellular features and cell cycle progression throughout cell fate segregation. We apply a probabilistic model to our dynamic data, providing a quantitative characterization of the mutual effects of YAP and cellular relative exposed area, which has previously been shown to correlate with subcellular YAP localization in fixed samples. Additionally, we study how nuclear YAP levels are influenced by other factors, such as the decreasing pool of maternally provided YAP that is partitioned to daughter cells through cleavage divisions, cell cycle-associated nuclear volume changes, and a delay after divisions in adjusting YAP levels to new cell positions. Interestingly, we find that establishing low nuclear YAP levels required for the inner cell mass fate is largely achieved by passive cell cycle-associated mechanisms. Moreover, contrary to expectations, we find that mechanical perturbations that result in cell shape changes do not influence YAP localization in the embryo. Together our work identifies how various inputs are integrated over a dynamic developmental time course to shape the levels of a key molecular determinant of the first cell fate choice.

Show Abstract
February 27, 2025

Spectral Analysis of Representational Similarity with Limited Neurons

Hyunmo Kang, A. Canatar, S. Chung

Measuring representational similarity between neural recordings and computational models is challenging due to constraints on the number of
neurons that can be recorded simultaneously. In this work, we investigate how such limitations affect similarity measures, focusing on Canonical Correlation Analysis (CCA) and Centered Kernel Alignment (CKA). Leveraging tools from Random Matrix Theory, we develop a predictive spectral framework for these measures and demonstrate that finite neuron sampling systematically underestimates similarity due to eigenvector de-
localization. To overcome this, we introduce a denoising method to infer population-level similarity, enabling accurate analysis even with small
neuron samples. Our theory is validated on synthetic and real datasets, offering practical strategies for interpreting neural data under finite sampling constraints.

Show Abstract
February 27, 2025

Type-I Superconductors in the Limit as the London Penetration Depth Goes to 0

C. Epstein, M. Rachh, Yuguan Wang

This paper provides an explicit formula for the approximate solution of the static London equations. These equations describe the currents and magnetic fields in a Type-I superconductor. We represent the magnetic field as a 2-form and the current as a 1-form, and assume that the superconducting material is contained in a bounded, connected set, Ω, with smooth boundary. The London penetration depth gives an estimate for the thickness of the layer near ∂Ω where the current is largely carried. In an earlier paper, we introduced a system of Fredholm integral equations of second kind, on ∂Ω, for solving the physically relevant scattering problems in this context. In real Type-I superconductors the penetration depth is very small, typically about 100nm, which often renders the integral equation approach computationally intractable. In this paper we provide an explicit formula for approximate solutions, with essentially optimal error estimates, as the penetration depth tends to zero. Our work makes extensive use of the Hodge decomposition of differential forms on manifolds with boundary, and thus evokes Kohn's work on the tangential Cauchy-Riemann equations.

Show Abstract

Generative model for the first cell fate bifurcation in mammalian development

M. Avdeeva, Madeleine Chalifoux, S. Shvartsman, et al.

The first cell fate bifurcation in mammalian development directs cells toward either the trophectoderm (TE) or inner cell mass (ICM) compartments in preimplantation embryos. This decision is regulated by the subcellular localization of a transcriptional co-activator YAP and takes place over several progressively asyn-chronous cleavage divisions. As a result of this asynchrony and variable arrangement of blastomeres, reconstructing the dynamics of the TE/ICM cell specification from fixed embryos is extremely challenging. To address this, we developed a live imaging approach and applied it to measure pairwise dynamics of nuclear YAP and its direct target genes, CDX2 and SOX2, key transcription factors of TE and ICM, respectively. Using these datasets, we constructed a generative model of the first cell fate bifurcation, which reveals the time-dependent statistics of the TE and ICM cell allocation. In addition to making testable predictions for the joint dynamics of the full YAP/CDX2/SOX2 motif, the model revealed the stochastic nature of the induction timing of the key cell fate determinants and identified the features of YAP dynamics that are necessary or sufficient for this induction. Notably, temporal heterogeneity was particularly prominent for SOX2 expression among ICM cells. As heterogeneities within the ICM have been linked to the initiation of the second cell fate decision in the embryo, understanding the origins of this variability is of key significance. The presented approach reveals the dynamics of the first cell fate choice and lays the groundwork for dissecting the next cell fate bifurcations in mouse development.

Show Abstract
February 25, 2025

Modeling Neural Activity with Conditionally Linear Dynamical Systems

Victor Geadah, A. Nejatbakhsh, D. Lipshutz, J. Pillow, A. Williams

Neural population activity exhibits complex, nonlinear dynamics, varying in time, over trials, and across experimental conditions. Here, we develop Conditionally Linear Dynamical System (CLDS) models as a general-purpose method to characterize these dynamics. These models use Gaussian Process (GP) priors to capture the nonlinear dependence of circuit dynamics on task and behavioral variables. Conditioned on these covariates, the data is modeled with linear dynamics. This allows for transparent interpretation and tractable Bayesian inference. We find that CLDS models can perform well even in severely data-limited regimes (e.g. one trial per condition) due to their Bayesian formulation and ability to share statistical power across nearby task conditions. In example applications, we apply CLDS to model thalamic neurons that nonlinearly encode heading direction and to model motor cortical neurons during a cued reaching task

Show Abstract

The ManifoldEM method for cryo-EM: a step-by-step breakdown accompanied by a modern Python implementation

A. A. Ojha, R. Blackwell, M. Astore, S. Hanson, et al.

Resolving continuous conformational heterogeneity in single-particle cryo-electron microscopy (cryo-EM) is a field in which new methods are now emerging regularly. Methods range from traditional statistical techniques to state-of-the-art neural network approaches. Such ongoing efforts continue to enhance the ability to explore and understand the continuous conformational variations in cryo-EM data. One of the first methods was the manifold embedding approach or ManifoldEM. However, comparing it with more recent methods has been challenging due to software availability and usability issues. In this work, we introduce a modern Python implementation that is user-friendly, orders of magnitude faster than its previous versions and designed with a developer-ready environment. This implementation allows a more thorough evaluation of the strengths and limitations of methods addressing continuous conformational heterogeneity in cryo-EM, paving the way for further community-driven improvements.

Show Abstract

Accurate close interactions of Stokes spheres using lubrication-adapted image systems

Anna Broms, A. Barnett, Anna-Karin Tornberg

Stokes flows with near-touching rigid particles induce near-singular lubrication forces under relative motion, making their accurate numerical treatment challenging. With the aim of controlling the accuracy with a computationally cheap method, we present a new technique that combines the method of fundamental solutions (MFS) with the method of images. For rigid spheres, we propose to represent the flow using Stokeslet proxy sources on interior spheres, augmented by lines of image sources adapted to each near-contact to resolve lubrication. Source strengths are found by a least-squares solve at contact-adapted boundary collocation nodes. We include extensive numerical tests, and validate against reference solutions from a well-resolved boundary integral formulation. With less than 60 additional image sources per particle per contact, we show controlled uniform accuracy to three relative digits in surface velocities, and up to five digits in particle forces and torques, for all separations down to a thousandth of the radius. In the special case of flows around fixed particles, the proxy sphere alone gives controlled accuracy. A one-body preconditioning strategy allows acceleration with the fast multipole method, hence close to linear scaling in the number of particles. This is demonstrated by solving problems of up to 2000 spheres on a workstation using only 700 proxy sources per particle.

Show Abstract

The Geometry of Prompting: Unveiling Distinct Mechanisms of Task Adaptation in Language Models

A. Kirsanov, C. Chou , Kyunghyun Cho, S. Chung

Decoder-only language models have the ability to dynamically switch between various computational tasks based on input prompts. Despite many successful applications of prompting, there is very limited understanding of the internal mechanism behind such flexibility. In this work, we investigate how different prompting methods affect the geometry of representations in these models. Employing a framework grounded in statistical physics, we reveal that various prompting techniques, while achieving similar performance, operate through distinct representational mechanisms for task adaptation. Our analysis highlights the critical role of input distribution samples and label semantics in few-shot in-context learning. We also demonstrate evidence of synergistic and interfering interactions between different tasks on the representational level. Our work contributes to the theoretical understanding of large language models and lays the groundwork for developing more effective, representation-aware prompting strategies.

Show Abstract
February 11, 2025
  • Previous Page
  • Viewing
  • Next Page
Advancing Research in Basic Science and MathematicsSubscribe to Flatiron Institute announcements and other foundation updates

privacy consent banner

Privacy preference

We use cookies to provide you with the best online experience. By clicking "Accept All," you help us understand how our site is used and enhance its performance. You can change your choice at any time here. To learn more, please visit our Privacy Policy.