Phenotype Search Trajectory Networks for Linear Genetic Programming

• URL: http://arxiv.org/abs/2211.08516v2
• Date: Fri, 23 Jun 2023 16:42:01 GMT
• Title: Phenotype Search Trajectory Networks for Linear Genetic Programming
• Authors: Ting Hu and Gabriela Ochoa and Wolfgang Banzhaf
• Abstract summary: 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.
• Score: 8.079719491562305
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Genotype-to-phenotype mappings translate genotypic variations such as mutations into phenotypic changes. Neutrality is the observation that some mutations do not lead to phenotypic changes. Studying the search trajectories in genotypic and phenotypic spaces, especially through neutral mutations, helps us to better understand the progression of evolution and its algorithmic behaviour. In this study, we visualise the search trajectories of a genetic programming system as graph-based models, where nodes are genotypes/phenotypes and edges represent their mutational transitions. We also quantitatively measure the characteristics of phenotypes including their genotypic abundance (the requirement for neutrality) and Kolmogorov complexity. We connect these quantified metrics with search trajectory visualisations, and find that more complex phenotypes are under-represented by fewer genotypes and are harder for evolution to discover. Less complex phenotypes, on the other hand, are over-represented by genotypes, are easier to find, and frequently serve as stepping-stones for evolution.

Related papers

• CSGDN: Contrastive Signed Graph Diffusion Network for Predicting Crop Gene-phenotype Associations [6.5678927417916455]
  We propose a Contrastive Signed Graph Diffusion Network, CSGDN, to learn robust node representations with fewer training samples to achieve higher link prediction accuracy. We conduct experiments to validate the performance of CSGDN on three crop datasets: Gossypium hirsutum, Brassica napus, and Triticum turgidum.
  arXiv  Detail & Related papers  (2024-10-10T01:01:10Z)
• Predicting Genetic Mutation from Whole Slide Images via Biomedical-Linguistic Knowledge Enhanced Multi-label Classification [119.13058298388101]
  We develop a Biological-knowledge enhanced PathGenomic multi-label Transformer to improve genetic mutation prediction performances. BPGT first establishes a novel gene encoder that constructs gene priors by two carefully designed modules. BPGT then designs a label decoder that finally performs genetic mutation prediction by two tailored modules.
  arXiv  Detail & Related papers  (2024-06-05T06:42:27Z)
• VQDNA: Unleashing the Power of Vector Quantization for Multi-Species Genomic Sequence Modeling [60.91599380893732]
  VQDNA is a general-purpose framework that renovates genome tokenization from the perspective of genome vocabulary learning. By leveraging vector-quantized codebooks as learnable vocabulary, VQDNA can adaptively tokenize genomes into pattern-aware embeddings.
  arXiv  Detail & Related papers  (2024-05-13T20:15:03Z)
• 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)
• A Comparative Analysis of Gene Expression Profiling by Statistical and Machine Learning Approaches [1.8954222800767324]
  We discuss the biological and the methodological limitations of machine learning models to classify cancer samples. Gene rankings are obtained from explainability methods adapted to these models. We observe that the information learned by black-box neural networks is related to the notion of differential expression.
  arXiv  Detail & Related papers  (2024-02-01T18:17:36Z)
• Unsupervised Learning of Invariance Transformations [105.54048699217668]
  We develop an algorithmic framework for finding approximate graph automorphisms. We discuss how this framework can be used to find approximate automorphisms in weighted graphs in general.
  arXiv  Detail & Related papers  (2023-07-24T17:03:28Z)
• 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)
• Few-Shot Meta Learning for Recognizing Facial Phenotypes of Genetic Disorders [55.41644538483948]
  Automated classification and similarity retrieval aid physicians in decision-making to diagnose possible genetic conditions as early as possible. Previous work has addressed the problem as a classification problem and used deep learning methods. In this study, we used a facial recognition model trained on a large corpus of healthy individuals as a pre-task and transferred it to facial phenotype recognition.
  arXiv  Detail & Related papers  (2022-10-23T11:52:57Z)
• Graph Coloring via Neural Networks for Haplotype Assembly and Viral Quasispecies Reconstruction [8.828330486848753]
  We develop a new method, called NeurHap, that combines graph representation learning with optimization. Our experiments demonstrate substantially better performance of NeurHap in real and synthetic datasets compared to competing approaches.
  arXiv  Detail & Related papers  (2022-10-21T12:53:09Z)
• 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)
• VEGN: Variant Effect Prediction with Graph Neural Networks [19.59965282985234]
  We propose VEGN, which models variant effect prediction using a graph neural network (GNN) that operates on a heterogeneous graph with genes and variants. The graph is created by assigning variants to genes and connecting genes with an gene-gene interaction network. VeGN improves the performance of existing state-of-the-art models.
  arXiv  Detail & Related papers  (2021-06-25T13:51:46Z)

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.