Searcharxiv⌕ Search

arXiv subjects

Jason Lamanna

Publications and source records attributed to Jason Lamanna.

2 recordsLinked to original sources

Recurrence in Sequence Space: How Epistasis Mimics Shared Ancestry

Sequences in a protein family do not explore the sequence space freely: folding, packing, and binding couple residues, so the set of viable sequences is irreducibly correlated, a phenomenon referred to as epistasis. We show that such correlations lower the \emph{intrinsic dimension} $d_{\rm IN}$ of sequence space, counteracting the concentration of measure and broadening the distribution of pairwise distances. Consequentially, they make it likely that independently evolving lineages \emph{recur}, approaching one another by chance long after they last shared an ancestor. Using Kac's lemma we show that the logarithmic mean recurrence time grows linearly with the intrinsic dimension, $\log τ_{\rm rec} \propto {d_{\rm IN}}$ for typical sequences, so strongly constrained (low-dimensional) families recur often and generate sequence similarity that carries no genealogical signal. We establish this first in a solvable Ising-like model with tunable correlation, then in a real protein family using Potts models and Markov chain Monte Carlo, where $d_{\rm IN}$ remains predictive of recurrence even in multi-basins landscapes. Because recurrence is a property of the evolutionary process rather than of any estimator, it bounds the recoverability of deep history for distance-based and likelihood methods alike.

q-bio.QM↗

HyperEvoGen: Exploring deep phylogeny using non-Euclidean variational inference

Homologous proteins evolve from a common ancestral sequence, constrained by intricate patterns of co-evolving residues. Accurate reconstruction of evolutionary histories remains a challenge, primarily due to the inability of the existing approaches to capture long-range coevolutionary ties and lack of a precise metric to represent the evolutionary distance between sequences. Standard approaches are based on p-distance or substitution-corrected measures such as Jukes-Cantor. These methods saturate in cases of deep evolutionary divergence, losing all evolutionary signal after enough time. We present HyperEvoGen, a Poincaré variational autoencoder with adversarial training, hyperbolic latent geometry, and a compound loss function that learns evolutionarily meaningful representations from single-family alignments. The arrangement of protein sequences in HyperEvoGen's hyperbolic embedding aims to preserve phylogenetic structure and produce latent distances which scale with true evolutionary divergence. HyperEvoGen enables fast, scalable modeling of protein evolution while preserving hierarchical relatedness in a geometry-aware representation. On Potts-coupled simulation benchmarks, it produces more accurate ancestral reconstructions than conventional baselines, and offers higher-quality sequence generation with less training time than Potts models. This combination of accuracy and throughput supports large-family evolutionary studies and accelerates design-oriented applications.

q-bio.QM↗