Tree-Conditioned Edit Flows for Ancestral Sequence Reconstruction

• URL: http://arxiv.org/abs/2605.04119v1
• Date: Tue, 05 May 2026 13:04:45 GMT
• Title: Tree-Conditioned Edit Flows for Ancestral Sequence Reconstruction
• Abstract summary: Ancestral sequence reconstruction aims to infer extinct protein sequences at internal nodes of a phylogenetic tree.<n>We introduce a tree-conditioned edit-flow model for variable-length ASR.<n>On a benchmark of natural sequences with abundant insertions and deletions, the model most accurately localizes evolutionary change.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ancestral sequence reconstruction (ASR) aims to infer extinct protein sequences at internal nodes of a phylogenetic tree. Classical ASR methods are typically based on continuous-time Markov substitution models, but they treat sites largely independently and handle insertions and deletions only weakly or not at all. We introduce a tree-conditioned edit-flow model for variable-length ASR. Given two descendant sequences and their branch distances to a shared ancestor, the model reconstructs the ancestor through paired bidirectional edit trajectories constrained to agree on a common ancestral state. On a benchmark of experimentally evolved sequences with only context-independent substitutions, the model does not match the accuracy of the best classical method, yet still achieves reasonable performance despite being trained on natural sequences that include insertions, deletions, and substitutions. On a benchmark of natural homologous sequences with abundant insertions and deletions, the model most accurately localizes inferred evolutionary change.

Related papers

• Graph construction in QUBO-based recursive phylogenetic tree reconstruction [0.30586855806896046]
  We evaluate sequence-to-affinity representations in a normalized-cut (Ncut) framework for phylogenetic reconstruction.<n> Affinity representation substantially affected internal split recovery, particularly for nucleotide data.<n>Post-swap refinement generally improved recovery, but not consistently across individual reconstructions.
  arXiv  Detail & Related papers  (2026-09-15T05:00:33Z)
• "More Is Different'' in Neural Circuits: Algebraic Emergence of Effective Theories in Canonical Recurrent Motifs of Biological Neuronal Networks [0.0]
  We represent Canonical neural circuit motifs and their compositions as finite transformation systems.<n>We analyze the transition monoids generated by their input-conditioned updates.
  arXiv  Detail & Related papers  (2026-08-31T04:36:37Z)
• Variational Learning for Insertion-based Generation [50.15012125719375]
  We introduce a probabilistic framework for learning insertion order in variable-length insertion models.<n>We propose the Insertion Process (IP), a generative model that jointly learns where to insert, what to insert, and when to terminate.
  arXiv  Detail & Related papers  (2026-06-01T11:59:46Z)
• scHelix: Asymmetric Dual-Stream Integration via Explicit Gene-Level Disentanglement [84.88065404629079]
  scHelix is a dataset-adaptive framework that fundamentally changes how features are processed.<n> scHelix utilizes a dual-stream sparse diffusion encoder equipped with stop-gradient graph caching.<n> scHelix outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-18T15:55:13Z)
• Conditionally Site-Independent Neural Evolution of Antibody Sequences [5.267260830624825]
  We introduce CoSiNE, a continuous-time Markov chain parameterized by a deep neural network.<n>We prove that CoSiNE provides a first-order approximation to the intractable sequential point mutation process.<n> Empirically, CoSiNE outperforms state-of-the-art language models in zero-shot variant effect prediction.
  arXiv  Detail & Related papers  (2026-02-21T23:23:30Z)
• PRISM: Parallel Residual Iterative Sequence Model [52.26239951489612]
  We propose PRISM (Parallel Residual Iterative Sequence Model) to resolve this tension.<n>PRISM introduces a solver-inspired inductive bias that captures key structural properties of multi-step refinement in a parallelizable form.<n>We prove that this formulation achieves Rank-$L$ accumulation, structurally expanding the update manifold beyond the single-step Rank-$1$ bottleneck.
  arXiv  Detail & Related papers  (2026-02-11T12:39:41Z)
• Spanning Tree Autoregressive Visual Generation [51.7635842702602]
  We present Spanning Tree Autoregressive (STAR) modeling, which can incorporate prior knowledge of images, such as center bias and locality, to maintain sampling performance.
  arXiv  Detail & Related papers  (2025-11-21T09:45:17Z)
• Approximate learning of parsimonious Bayesian context trees [0.0]
  The proposed framework is tested on synthetic and real-world data examples. It outperforms existing sequence models when fitted to real protein sequences and honeypot computer terminal sessions.
  arXiv  Detail & Related papers  (2024-07-27T11:50:40Z)
• Semantic Self-adaptation: Enhancing Generalization with a Single Sample [45.111358665370524]
  We propose a self-adaptive approach for semantic segmentation. It fine-tunes the parameters of convolutional layers to the input image using consistency regularization. Our empirical study suggests that self-adaptation may complement the established practice of model regularization at training time.
  arXiv  Detail & Related papers  (2022-08-10T12:29:01Z)
• EvoVGM: A Deep Variational Generative Model for Evolutionary Parameter Estimation [0.0]
  We propose a method for a deep variational Bayesian generative model that jointly approximates the true posterior of local biological evolutionary parameters. We show the consistency and effectiveness of the method on synthetic sequence alignments simulated with several evolutionary scenarios and on a real virus sequence alignment.
  arXiv  Detail & Related papers  (2022-05-25T20:08:10Z)
• Posterior Differential Regularization with f-divergence for Improving Model Robustness [95.05725916287376]
  We focus on methods that regularize the model posterior difference between clean and noisy inputs. We generalize the posterior differential regularization to the family of $f$-divergences. Our experiments show that regularizing the posterior differential with $f$-divergence can result in well-improved model robustness.
  arXiv  Detail & Related papers  (2020-10-23T19:58:01Z)
• Conditional Hybrid GAN for Sequence Generation [56.67961004064029]
  We propose a novel conditional hybrid GAN (C-Hybrid-GAN) to solve this issue. We exploit the Gumbel-Softmax technique to approximate the distribution of discrete-valued sequences. We demonstrate that the proposed C-Hybrid-GAN outperforms the existing methods in context-conditioned discrete-valued sequence generation.
  arXiv  Detail & Related papers  (2020-09-18T03:52:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.