Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Genetic Algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,207 records · Page 67
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

A Comparison of Genetic Programming Variants for Hyper-Heuristics

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

PathTracer Comprehensively Identifies Hypoxia-Induced Dormancy Adaptations in Mycobacterium tuberculosis

Mining large-scale data to discover biologically relevant information remains a challenge despite the rapid development of bioinformatics tools. Here, we have developed a new tool, PathTracer, to identify biologically relevant information flows by mining genome-wide protein–protein interaction networks following integration of gene expression data. PathTracer successfully mines interactions between genes and traces the most perturbed paths of perceived activities under the conditions of the study. Here, we further demonstrated the utility of this tool by identifying adaptation mechanisms of hypoxia-induced dormancy in Mycobacterium tuberculosis (Mtb).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

A Genome-Scale Metabolic Model of Anabaena 33047 to Guide Genetic Modifications to Overproduce Nylon Monomers

Nitrogen fixing-cyanobacteria can significantly improve the economic feasibility of cyanobacterial production processes by eliminating the requirement for reduced nitrogen. Anabaena sp. ATCC 33047 is a marine, heterocyst forming, nitrogen fixing cyanobacteria with a very short doubling time of 3.8 h. We developed a comprehensive genome-scale metabolic (GSM) model, iAnC892, for this organism using annotations and content obtained from multiple databases. iAnC892 describes both the vegetative and heterocyst cell types found in the filaments of Anabaena sp. ATCC 33047. iAnC892 includes 953 unique reactions and accounts for the annotation of 892 genes. Comparison of iAnC892 reaction content with the GSM of Anabaena sp. PCC 7120 revealed that there are 109 reactions including uptake hydrogenase, pyruvate decarboxylase, and pyruvate-formate lyase unique to iAnC892. iAnC892 enabled the analysis of energy production pathways in the heterocyst by allowing the cell specific deactivation of light dependent electron transport chain and glucose-6-phosphate metabolizing pathways. The analysis revealed the importance of light dependent electron transport in generating ATP and NADPH at the required ratio for optimal N2 fixation. When used alongside the strain design algorithm, OptForce, iAnC892 recapitulated several of the experimentally successful genetic intervention strategies that over produced valerolactam and caprolactam precursors.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Ontologizing health systems data at scale: making translational discovery a reality

Common data models solve many challenges of standardizing electronic health record (EHR) data but are unable to semantically integrate all of the resources needed for deep phenotyping. Open Biological and Biomedical Ontology (OBO) Foundry ontologies provide computable representations of biological knowledge and enable the integration of heterogeneous data. However, mapping EHR data to OBO ontologies requires significant manual curation and domain expertise. We introduce OMOP2OBO, an algorithm for mapping Observational Medical Outcomes Partnership (OMOP) vocabularies to OBO ontologies. Using OMOP2OBO, we produced mappings for 92,367 conditions, 8611 drug ingredients, and 10,673 measurement results, which covered 68–99% of concepts used in clinical practice when examined across 24 hospitals. When used to phenotype rare disease patients, the mappings helped systematically identify undiagnosed patients who might benefit from genetic testing. By aligning OMOP vocabularies to OBO ontologies our algorithm presents new opportunities to advance EHR-based deep phenotyping.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2014

SU-E-J-98: Radiogenomics: Correspondence Between Imaging and Genetic Features Based On Clustering Analysis

Purpose: Radiogenomics aims to establish relationships between patient genotypes and imaging phenotypes. An open question remains on how best to integrate information from these distinct datasets. This work investigates if similarities in genetic features across patients correspond to similarities in PET-imaging features, assessed with various clustering algorithms. Methods: [{sup 18}F]FDG PET data was obtained for 26 NSCLC patients from a public database (TCIA). Tumors were contoured using an in-house segmentation algorithm combining gradient and region-growing techniques; resulting ROIs were used to extract 54 PET-based features. Corresponding genetic microarray data containing 48,778 elements were also obtained for each tumor. Given mismatch in feature sizes, two dimension reduction techniques were also applied to the genetic data: principle component analysis (PCA) and selective filtering of 25 NSCLC-associated genes-ofinterest (GOI). Gene datasets (full, PCA, and GOI) and PET feature datasets were independently clustered using K-means and hierarchical clustering using variable number of clusters (K). Jaccard Index (JI) was used to score similarity of cluster assignments across different datasets. Results: Patient clusters from imaging data showed poor similarity to clusters from gene datasets, regardless of clustering algorithms or number of clusters (JI{sub mean}= 0.3429±0.1623). Notably, we found clustering algorithms had different sensitivities to data reduction techniques. Using hierarchical clustering, the PCA dataset showed perfect cluster agreement to the full-gene set (JI =1) for all values of K, and the agreement between the GOI set and the full-gene set decreased as number of clusters increased (JI=0.9231 and 0.5769 for K=2 and 5, respectively). K-means clustering assignments were highly sensitive to data reduction and showed poor stability for different values of K (JI{sub range}: 0.2301–1). Conclusion: Using commonly-used clustering algorithms, we found poor agreement in patient characterization from genomic versus imaging data. Interpretation of radiogenomic associations was found to be dependent on clustering algorithms and sensitive to data reduction techniques.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

Alignment of Short Reads: A Crucial Step for Application of Next-Generation Sequencing Data in Precision Medicine

Precision medicine or personalized medicine has been proposed as a modernized and promising medical strategy. Genetic variants of patients are the key information for implementation of precision medicine. Next-generation sequencing (NGS) is an emerging technology for deciphering genetic variants. Alignment of raw reads to a reference genome is one of the key steps in NGS data analysis. Many algorithms have been developed for alignment of short read sequences since 2008. Users have to make a decision on which alignment algorithm to use in their studies. Selection of the right alignment algorithm determines not only the alignment algorithm but also the set of suitable parameters to be used by the algorithm. Understanding these algorithms helps in selecting the appropriate alignment algorithm for different applications in precision medicine. Here, we review current available algorithms and their major strategies such as seed-and-extend and q-gram filter. We also discuss the challenges in current alignment algorithms, including alignment in multiple repeated regions, long reads alignment and alignment facilitated with known genetic variants.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

CMPLE: Correlation Modeling to Decode Photosynthesis Using the Minorize–Maximize Algorithm

In plant genomic experiments, correlations among various biological traits (phenotypes) give new insights into how genetic diversity may have tuned biological processes to enhance fitness under diverse conditions. Consequently, knowing how the correlations are affected by genetic (G) and environmental (E) factors helps develop climate-resilient plants. However, the current literature lacks any method for assessing the effect of predictors on pairwise correlations among multiple phenotypes together with easily interpretable model parameters. To address this need, we propose to model pairwise correlations directly in terms of G and E and develop a computationally efficient inference procedure. Two major novelties in our methodology are (1) the use of a composite pairwise likelihood method to avoid the positive definiteness restriction on the correlation matrix and (2) the use of a novel Minorize–Maximize (MM) algorithm for the efficient estimation of a large number of parameters. The proposed method shows excellent numerical performance on synthetic datasets. Here, the analysis of the motivating data on cowpea reveals that the rates of solar energy storage by photosynthesis (the aggregate trait) are differentially affected by different genetic loci through two distinct processes: “photoinhibition” which results from photodamage caused by excess light, and “photoprotection” which protects plants from photodamage but also results in energy loss.

Correlation modeling↗
DOE OSTI2023

Maast: genotyping thousands of microbial strains efficiently

Existing single nucleotide polymorphism (SNP) genotyping algorithms do not scale for species with thousands of sequenced strains, nor do they account for conspecific redundancy. Here we present a bioinformatics tool, Maast, which empowers population genetic meta-analysis of microbes at an unrivaled scale. Maast implements a novel algorithm to heuristically identify a minimal set of diverse conspecific genomes, then constructs a reliable SNP panel for each species, and enables rapid and accurate genotyping using a hybrid of whole-genome alignment and k-mer exact matching. We demonstrate Maast’s utility by genotyping thousands of Helicobacter pylori strains and tracking SARS-CoV-2 diversification.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Dynamics of genetic code evolution: The emergence of universality

We study the dynamics of genetic code evolution. The model of Vetsigian et al. [Proc. Natl. Acad. Sci. USA 103, 10696 (2006)] and Vetsigian [Collective evolution of biological and physical systems, Ph.D. thesis, 2005] uses the mechanism of horizontal gene transfer to demonstrate convergence of the genetic code to a near universal solution. We reproduce and analyze the algorithm as a dynamical system. All the parameters used in the model are varied to assess their impact on convergence and optimality score. We show that by allowing specific parameters to vary with time, the solution exhibits attractor dynamics. Finally, we study automorphisms of the genetic code arising due to this model. We use this to examine the scaling of the solutions to re-examine universality and find that there is a direct link to mutation rate.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

The interplay between chromosome stability and cell cycle control explored through gene–gene interaction and computational simulation

Chromosome stability models are usually qualitative models derived from molecular-genetic mechanisms for DNA repair, DNA synthesis, and cell division. While qualitative models are informative, they are also challenging to reformulate as precise quantitative models. In this report we explore how (A) laboratory experiments, (B) quantitative simulation, and (C) seriation algorithms can inform models of chromosome stability. Laboratory experiments were used to identify 19 genes that when over-expressed cause chromosome instability in the yeast Saccharomyces cerevisiae . To better understand the molecular mechanisms by which these genes act, we explored their genetic interactions with 18 deletion mutations known to cause chromosome instability. Quantitative simulations based on a mathematical model of the cell cycle were used to predict the consequences of several genetic interactions. These simulations lead us to suspect that the chromosome instability genes cause cell-cycle perturbations. Cell-cycle involvement was confirmed using a seriation algorithm, which was used to analyze the genetic interaction matrix to reveal an underlying cyclical pattern. The seriation algorithm searched over 10 14 possible arrangements of rows and columns to find one optimal arrangement, which correctly reflects events during cell cycle phases. To conclude, we illustrate how the molecular mechanisms behind these cell cycle events are consistent with established molecular interaction maps.

Biochemistry & Molecular Biology↗
DOE OSTI2025

Introducing GPU Acceleration into the Python-Based Simulations of Chemistry Framework

We introduce the first version of GPU4P Y SCF, a module that provides GPU acceleration of methods in P Y SCF. As a core functionality, this provides a GPU implementation of two-electron repulsion integrals (ERIs) for contracted basis sets comprising up to g functions using the Rys quadrature. As an illustration of how this can accelerate a quantum chemistry workflow, we describe how to use the ERIs efficiently in the integral-direct Hartree–Fock build and nuclear gradient construction. Benchmark calculations show a significant speedup of 2 orders of magnitude with respect to the multithreaded CPU Hartree–Fock code of P Y SCF and the performance comparable to other open-source GPU-accelerated quantum chemical packages, including GAMESS and QUICK, on a single NVIDIA A100 GPU.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

A genomic data archive from the Network for Pancreatic Organ donors with Diabetes

The Network for Pancreatic Organ donors with Diabetes (nPOD) is the largest biorepository of human pancreata and associated immune organs from donors with type 1 diabetes (T1D), maturity-onset diabetes of the young (MODY), cystic fibrosis-related diabetes (CFRD), type 2 diabetes (T2D), gestational diabetes, islet autoantibody positivity (AAb+), and without diabetes. nPOD recovers, processes, analyzes, and distributes high-quality biospecimens, collected using optimized standard operating procedures, and associated de-identified data/metadata to researchers around the world. Herein describes the release of high-parameter genotyping data from this collection. 372 donors were genotyped using a custom precision medicine single nucleotide polymorphism (SNP) microarray. Data were technically validated using published algorithms to evaluate donor relatedness, ancestry, imputed HLA, and T1D genetic risk score. Additionally, 207 donors were assessed for rare known and novel coding region variants via whole exome sequencing (WES). These data are publicly-available to enable genotype-specific sample requests and the study of novel genotype:phenotype associations, aiding in the mission of nPOD to enhance understanding of diabetes pathogenesis to promote the development of novel therapies.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Gene-by-environment interactions in plants: Molecular mechanisms, environmental drivers, and adaptive plasticity

Abstract Plants demonstrate a broad range of responses to environmental shifts. One of the most remarkable responses is plasticity, which is the ability of a single plant genotype to produce different phenotypes in response to environmental stimuli. As with all traits, the ability of plasticity to evolve depends on the presence of underlying genetic diversity within a population. A common approach for evaluating the role of genetic variation in driving differences in plasticity has been to study genotype-by-environment interactions (G × E). G × E occurs when genotypes produce different phenotypic trait values in response to different environments. In this review, we highlight progress and promising methods for identifying the key environmental and genetic drivers of G × E. Specifically, methodological advances in using algorithmic and multivariate approaches to understand key environmental drivers combined with new genomic innovations can greatly increase our understanding about molecular responses to environmental stimuli. These developing approaches can be applied to proliferating common garden networks that capture broad natural environmental gradients to unravel the underlying mechanisms of G × E. An increased understanding of G × E can be used to enhance the resilience and productivity of agronomic systems.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Hypergraph Random Walks, Laplacians, and Clustering

We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights. When incorporating edge-dependent vertex weights (EDVW), a weight is associated with each vertex-hyperedge pair, yielding a weighted incidence matrix of the hypergraph. Such weightings have been utilized in term-document representations of text data sets. We explain how random walks with EDVW serve to construct different hypergraph Laplacian matrices, and then develop a suite of clustering methods that use these incidence matrices and Laplacians for hypergraph clustering. Using 20Newsgroup, U.S. patent, Reuters' Corpus Volume 1, and genetics data sets, we compare the performance of these clustering algorithms experimentally against a variety of existing hypergraph clustering methods. We show that the proposed methods produce higher-quality clusters.

hypergraphs, clustering, laplacian, random walk, M↗
DOE OSTI2018

BubbleCluster v4

The BubbleCluster algorithm was developed to help address the limitations of traditional genetic mapping tools when presented with large amounts of data. The BubbleCluster software is a tool for the initial stage in the genetic mapping pipeline -- clustering genetic markers into linkage groups. BubbleCluster was designed to tackle large genetic marker data sets, and has been tested on input of up to 1.6M markers. Input format is identical to that of the popular MSTMap package, aiding useability.

Buluc, Aydin↗
DOE OSTI2016

Utilizing Genetic Programming to Identify Failures in ICS Networks

Previously, researchers have attempted to apply machine learning techniques to network anomaly detection problems. Due to the staggering amount of variety that can occur in normal networks, the results have often been underwhelming. These challenges are far less pronounced when considering industrial control system (ICS) networks. The recurrent nature of these networks results in less noise and more consistent patterns for a machine learning algorithm to recognize. Here, we propose a method of evolving decision trees through genetic programming (GP) in order to detect network anomalies, such as device outages. Our approach extracts over a dozen features from network packet captures and netflows, normalizes them, and relates them in decision trees using fuzzy logic operators. Furthermore, the trees were used to detect three specific network events from three different points on the network across a statistically significant number of runs and achieved 100% accuracy on five of the nine experiments. When the trees attempted to detect more challenging events at points of presence further from the occurrence, the accuracy averaged to above 98%. Finally, using our method, all of the evolutionary cycles of the GP algorithm are computed a-priori, allowing the best resultant trees to be deployed as semi-real-time sensors with little overhead.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Numerical Method for Fractional Advection-Diffusion Equation with Heredity

We propose a method of construction of difference schemes for fractional partial differential equations with delay in time. For the fractional equation with two-sided diffusion, fractional transfer in time, and a functional aftereffect, we construct an implicit difference scheme. We use the shifted Grünwald–Letnikov formulas for the approximation of fractional derivatives with respect to spatial variables and the L1-algorithm for the approximation of fractional derivatives in time. Also we use piecewise constant interpolation and extrapolation by extending the discrete prehistory of the model in time. The algorithm is a fractional analog of a purely implicit method; on each time step, it is reduced to the solution of linear algebraic systems. We prove the stability of the method and find its order of convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Multinode Multi-GPU Two-Electron Integrals: Code Generation Using the Regent Language

The computation of two-electron repulsion integrals (ERIs) is often the most expensive step of integral-direct self-consistent field methods. Formally it scales as O(N 4 ), where N is the number of Gaussian basis functions used to represent the molecular wave function. In practice, this scaling can be reduced to O(N 2 ) or less by neglecting small integrals with screening methods. The contributions of the ERIs to the Fock matrix are of Coulomb (J) and exchange (K) type and require separate algorithms to compute matrix elements efficiently. We previously implemented highly efficient GPU-accelerated J-matrix and K-matrix algorithms in the electronic structure code TeraChem. Although these implementations supported the use of multiple GPUs on a node, they did not support the use of multiple nodes. This presents a key bottleneck to cutting-edge ab initio simulations of large systems, e.g., excited state dynamics of photoactive proteins. We present our implementation of multinode multi-GPU J- and K-matrix algorithms in TeraChem using the Regent programming language. Regent directly supports distributed computation in a task-based model and can generate code for a variety of architectures, including NVIDIA GPUs. We demonstrate multinode scaling up to 45 GPUs (3 nodes) and benchmark against hand-coded TeraChem integral code. Finally, we also outline our metaprogrammed Regent implementation, which enables flexible code generation for integrals of different angular momenta.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗