Probabilistic Genotype-Phenotype Maps Reveal Mutational Robustness of RNA Folding, Spin Glasses, and Quantum Circuits

• URL: http://arxiv.org/abs/2301.01847v2
• Date: Thu, 22 Aug 2024 19:45:33 GMT
• Title: Probabilistic Genotype-Phenotype Maps Reveal Mutational Robustness of RNA Folding, Spin Glasses, and Quantum Circuits
• Authors: Anna Sappington, Vaibhav Mohanty,
• Abstract summary: We introduce probabilistic genotype-phenotype maps, where each genotype maps to a vector of phenotype probabilities. We study three model systems to show that PrGP maps offer a generalized framework which can handle uncertainty emerging from various physical sources. We derive an analytical theory for the behavior of PrGP robustness, and we demonstrate that the theory is highly predictive of empirical robustness.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent studies of genotype-phenotype (GP) maps have reported universally enhanced phenotypic robustness to genotype mutations, a feature essential to evolution. Virtually all of these studies make a simplifying assumption that each genotype -- represented as a sequence -- maps deterministically to a single phenotype, such as a discrete structure. Here, we introduce probabilistic genotype-phenotype (PrGP) maps, where each genotype maps to a vector of phenotype probabilities, as a more realistic and universal language for investigating robustness in a variety of physical, biological, and computational systems. We study three model systems to show that PrGP maps offer a generalized framework which can handle uncertainty emerging from various physical sources: (1) thermal fluctuation in RNA folding, (2) external field disorder in spin glass ground state finding, and (3) superposition and entanglement in quantum circuits, which are realized experimentally on IBM quantum computers. In all three cases, we observe a novel biphasic robustness scaling which is enhanced relative to random expectation for more frequent phenotypes and approaches random expectation for less frequent phenotypes. We derive an analytical theory for the behavior of PrGP robustness, and we demonstrate that the theory is highly predictive of empirical robustness.

Related papers

• Causal Representation Learning from Multimodal Biological Observations [57.00712157758845]
  We aim to develop flexible identification conditions for multimodal data. We establish identifiability guarantees for each latent component, extending the subspace identification results from prior work. Our key theoretical ingredient is the structural sparsity of the causal connections among distinct modalities.
  arXiv  Detail & Related papers  (2024-11-10T16:40:27Z)
• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• On The Nature Of The Phenotype In Tree Genetic Programming [3.8642945120580703]
  We discuss the basic concepts of genotypes and phenotypes in tree-based GP (TGP) We then analyze their behavior using five benchmark datasets. To generate phenotypes, we provide a unique technique for removing semantically ineffective code from GP trees.
  arXiv  Detail & Related papers  (2024-02-12T19:19:29Z)
• evolSOM: an R Package for evolutionary conservation analysis with SOMs [0.4972323953932129]
  We introduce evolSOM, a novel R package that utilizes Self-Organizing Maps (SOMs) to explore and visualize the conservation of biological variables. The package automatically calculates and graphically presents displacements, enabling efficient comparison and revealing conserved and displaced variables. Illustratively, we employed evolSOM to study the displacement of genes and phenotypic traits, successfully identifying potential drivers of phenotypic differentiation in grass leaves.
  arXiv  Detail & Related papers  (2024-02-09T20:33:48Z)
• Equivariant Flow Matching with Hybrid Probability Transport [69.11915545210393]
  Diffusion Models (DMs) have demonstrated effectiveness in generating feature-rich geometries. DMs typically suffer from unstable probability dynamics with inefficient sampling speed. We introduce geometric flow matching, which enjoys the advantages of both equivariant modeling and stabilized probability dynamics.
  arXiv  Detail & Related papers  (2023-12-12T11:13:13Z)
• Unsupervised ensemble-based phenotyping helps enhance the discoverability of genes related to heart morphology [57.25098075813054]
  We propose a new framework for gene discovery entitled Un Phenotype Ensembles. It builds a redundant yet highly expressive representation by pooling a set of phenotypes learned in an unsupervised manner. These phenotypes are then analyzed via (GWAS), retaining only highly confident and stable associations.
  arXiv  Detail & Related papers  (2023-01-07T18:36:44Z)
• Phenotype Search Trajectory Networks for Linear Genetic Programming [8.079719491562305]
  Neutrality is the observation that some mutations do not lead to phenotypic changes. We study the search trajectories of a genetic programming system as graph-based models. We measure the characteristics of phenotypes including their genotypic abundance and Kolmogorov complexity.
  arXiv  Detail & Related papers  (2022-11-15T21:20:50Z)
• Evolving Complexity is Hard [0.0]
  Genotype-phenotype maps are fundamental to evolution and enable evolution by following phenotype-preserving walks in genotype space. Here we use a digital logic gate circuit G-P map where genotypes are represented by circuits and phenotypes by the functions that the circuits compute. We show that the logic gate circuit shares many universal properties of biologically derived G-P maps, with the exception of the relationship between one method of computing phenotypic evolvability, robustness, and complexity.
  arXiv  Detail & Related papers  (2022-09-16T19:13:02Z)
• Neural network facilitated ab initio derivation of linear formula: A case study on formulating the relationship between DNA motifs and gene expression [8.794181445664243]
  We propose a framework for ab initio derivation of sequence motifs and linear formula using a new approach based on the interpretable neural network model. We showed that this linear model could predict gene expression levels using promoter sequences with a performance comparable to deep neural network models.
  arXiv  Detail & Related papers  (2022-08-19T22:29:30Z)
• rfPhen2Gen: A machine learning based association study of brain imaging phenotypes to genotypes [71.1144397510333]
  We learned machine learning models to predict SNPs using 56 brain imaging QTs. SNPs within the known Alzheimer disease (AD) risk gene APOE had lowest RMSE for lasso and random forest. Random forests identified additional SNPs that were not prioritized by the linear models but are known to be associated with brain-related disorders.
  arXiv  Detail & Related papers  (2022-03-31T20:15:22Z)
• Complexity-based speciation and genotype representation for neuroevolution [81.21462458089142]
  This paper introduces a speciation principle for neuroevolution where evolving networks are grouped into species based on the number of hidden neurons. The proposed speciation principle is employed in several techniques designed to promote and preserve diversity within species and in the ecosystem as a whole.
  arXiv  Detail & Related papers  (2020-10-11T06:26:56Z)

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.