Search NASA⌕ Search

SEARCH · Search NASA

Results for “Models, Genetic”

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 109 records · Page 6

Information transfer from peptide nucleic acids to RNA by template-directed syntheses

Peptide nucleic acids (PNAs) are uncharged analogs of DNA and RNA in which the ribose-phosphate backbone is substituted by a backbone held together by amide bonds. PNAs are interesting as models of alternative genetic systems because they form potentially informational base paired helical structures. A PNA C10 oligomer has been shown to act as template for efficient formation of oligoguanylates from activated guanosine ribonucleotides. In a previous paper we used heterosequences of DNA as templates in sequence-dependent polymerization of PNA dimers. In this paper we show that information can be transferred from PNA to RNA. We describe the reactions of activated mononucleotides on heterosequences of PNA. Adenylic, cytidylic and guanylic acids were incorporated into the products opposite their complement on PNA, although less efficiently than on DNA templates.

NASA Discipline Exobiology↗

Evaluation of Genetic Algorithm Concepts Using Model Problems: Multi-Objective Optimization - Part 2

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of simple model problems. Several new features including a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all optimization problems attempted. The binning algorithm generally provides pareto front quality enhancements and moderate convergence efficiency improvements for most of the model problems. The gene-space transformation procedure provides a large convergence efficiency enhancement for problems with non-convoluted pareto fronts and a degradation in efficiency for problems with convoluted pareto fronts. The most difficult problems --multi-mode search spaces with a large number of genes and convoluted pareto fronts-- require a large number of function evaluations for GA convergence, but always converge.

Holst, Terry L.↗

Evaluation of Genetic Algorithm Concepts using Model Problems: Single-Objective Optimization - Part 1

A genetic-algorithm-based optimization approach is described and evaluated using a simple hill-climbing model problem. The model problem utilized herein allows for the broad specification of a large number of search spaces including spaces with an arbitrary number of genes or decision variables and an arbitrary number hills or modes. In the present study, only single objective problems are considered. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all problems attempted. The most difficult problems - those with large hyper-volumes and multi-mode search spaces containing a large number of genes - require a large number of function evaluations for GA convergence, but they always converge.

Holst, Terry L.↗

The thioredoxin TRX-1 regulates adult lifespan extension induced by dietary restriction in Caenorhabditis elegans

Highlights: {yields} First in vivo data for thioredoxin in dietary-restriction-(DR)-induced longevity. {yields} Thioredoxin (trx-1) loss suppresses longevity of eat-2 mutant, a genetic DR model. {yields} trx-1 overexpression extends wild-type longevity, but not that of eat-2 mutant. {yields} Longevity by dietary deprivation (DD), a non-genetic DR model, requires trx-1. {yields} trx-1 expression in ASJ neurons of aging adults is increased in response to DD. -- Abstract: Dietary restriction (DR) is the only environmental intervention known to extend adult lifespan in a wide variety of animal models. However, the genetic and cellular events that mediate the anti-aging programs induced by DR remain elusive. Here, we used the nematode Caenorhabditis elegans to provide the first in vivo evidence that a thioredoxin (TRX-1) regulates adult lifespan extension induced by DR. We found that deletion of the gene trx-1 completely suppressed the lifespan extension caused by mutation of eat-2, a genetic surrogate of DR in the worm. However, trx-1 deletion only partially suppressed the long lifespan caused by mutation of the insulin-like receptor gene daf-2 or by mutation of the sensory cilia gene osm-5. A trx-1::GFP translational fusion expressed from its own promoter in ASJ neurons (Ptrx-1::trx-1::GFP) rescued the trx-1 deletion-mediated suppression of the lifespan extension caused by mutation of eat-2. This rescue was not observed when trx-1::GFP was expressed from the ges-1 promoter in the intestine. In addition, overexpression of Ptrx-1::trx-1::GFP extended lifespan in wild type, but not in eat-2 mutants. trx-1 deletion almost completely suppressed the lifespan extension induced by dietary deprivation (DD), a non-genetic, nutrient-based model of DR in the worm. Moreover, DD upregulated the expression of a trx-1 promoter-driven GFP reporter gene (Ptrx-1::GFP) in ASJ neurons of aging adults, but not that of control Pgpa-9::GFP (which is also expressed in ASJ neurons). We propose that DR activates TRX-1 in ASJ neurons during aging, which in turn triggers TRX-1-dependent mechanisms to extend adult lifespan in the worm.

60 APPLIED LIFE SCIENCES↗

Calibration of Car-Following Models Using a Dual Genetic Algorithm with Central Composite Design

We report the calibration of microscopic traffic simulation models has received much attention in the simulation field. Although no standard has been established for it, a genetic algorithm (GA) has been widely employed in recent literature because of its high efficiency to find solutions in such optimization problems. However, the performance still falls short in simulation analyses to support fast decision making. This paper proposes a new calibration procedure using a dual GA and central composite design (CCD) in order to improve the efficiency. The calibration exercise goes through three major sequential steps: (1) experimental design using CCD for a quadratic response surface model (RSM) estimation, (2) 1st GA procedure using the RSM with CCD to find a near-optimal initial population for a next step, and (3) 2nd GA procedure to find a final solution. The proposed method was applied in calibrating the Gipps car-following model with respect to maximizing the likelihood of a spacing distribution between a lead and following vehicle. In order to evaluate the performance of the proposed method, a conventional calibration approach using a single GA was compared under both simulated and real vehicle trajectory data. It was found that the proposed approach enhances the optimization speed by starting to search from an initial population that is closer to the optimum than that of the other approach. This result implies the proposed approach has benefits for a large-scale traffic network simulation analysis. Finally, this method can be extended to other optimization tasks using GA in transportation studies.

42 ENGINEERING↗

Modeling the Normal and Neoplastic Cell Cycle with 'Realistic Boolean Genetic Networks': Their Application for Understanding Carcinogenesis and Assessing Therapeutic Strategies

In this paper we show how Boolean genetic networks could be used to address complex problems in cancer biology. First, we describe a general strategy to generate Boolean genetic networks that incorporate all relevant biochemical and physiological parameters and cover all of their regulatory interactions in a deterministic manner. Second, we introduce 'realistic Boolean genetic networks' that produce time series measurements very similar to those detected in actual biological systems. Third, we outline a series of essential questions related to cancer biology and cancer therapy that could be addressed by the use of 'realistic Boolean genetic network' modeling.

Szallasi, Zoltan↗

Genetic Algorithms and Local Search

The first part of this presentation is a tutorial level introduction to the principles of genetic search and models of simple genetic algorithms. The second half covers the combination of genetic algorithms with local search methods to produce hybrid genetic algorithms. Hybrid algorithms can be modeled within the existing theoretical framework developed for simple genetic algorithms. An application of a hybrid to geometric model matching is given. The hybrid algorithm yields results that improve on the current state-of-the-art for this problem.

Whitley, Darrell↗

Reconstruction of larval origins based on genetic relatedness and biophysical modeling

The assessment of the mechanisms and patterns of larval connectivity between geographically separated populations leads to a better understanding of benthic marine population dynamics, especially in commercially valuable species. This study investigated for the first time the fine-scale temporal genetic variability of new settlers and their origins in a benthic marine organism with one of the longest pelagic larval phases, the Caribbean spiny lobster (Panulirus argus). We genotyped newly settled postlarvae in the Florida Keys and adults of spiny lobster from the Florida Keys and throughout the Caribbean Sea. We identified strong larval connectivity between Dominican Republic, Belize, Nicaragua, the Florida Keys, and West-Florida. the larval dispersal modeling suggests that Florida’s lobster population could receive recruits from within and from other areas outside its state and national maritime boundaries. The genetic analyses refine the oceanographic model indicating that the connectivity patterns described could also result from unknown parental populations sourcing adults and postlarvae in different spawning seasons to the Florida Keys. We discuss the importance of small temporal scales to identify patterns in larval export. Our findings are significant on two levels. From the larval dispersal perspective, genetic results and biophysical modeling identify patterns of gene flow enhancing persistence of local populations. From an economic and fishery perspective, P. argus is the most important commercial species in the Caribbean and our results inform how considering larval source and sink dynamics across international boundaries could improve management plans at local, national, and regional levels.

59 BASIC BIOLOGICAL SCIENCES↗

Thermal Property Estimation of Fibrous Insulation: Heat Transfer Modeling and the Continuous Genetic Algorithm

Thermal properties of high-temperature fibrous insulation materials were estimated from transient thermal tests using an inverse heat transfer technique. Transient temperature data from an experimental set up was collected and a simple, one-dimensional numerical model was constructed to replicate the temperatures within the test assembly. The Continuous Genetic Algorithm optimization technique in conjunction with a numerical thermal model and transient test data was used to estimate coefficients of a functional representation of the thermal property. The thermal properties, i.e., thermal conductivity and specific heat, of an alumina insulation felt were estimated over the temperature range of 300 K to 1700 K at various constant static pressures in nitrogen gas and compared with published data. The resulting thermal property estimates were within 10% of published values over the entire temperature range at various pressures. The methodology, application, and results are presented.

Frye, Elora↗

FluxRETAP: a REaction TArget Prioritization genome-scale modeling technique for selecting genetic targets

MOTIVATION: Metabolic engineering is rapidly evolving as a result of new advances in synthetic biology tools and automation platforms that enable high throughput strain construction, as well as the development of machine learning tools (ML) for biology. However, selecting genetic engineering targets that effectively guide the metabolic engineering process is still challenging. ML can provide predictive power for synthetic biology, but current technical limitations prevent the independent use of ML approaches without previous biological knowledge. RESULTS: Here, we present FluxRETAP, a simple and computationally inexpensive method that leverages the prior mechanistic knowledge embedded in genome-scale models for suggesting targets for genetic overexpression, downregulation or deletion, with the final goal of increasing the production of a desired metabolite. This method can provide a list of desirable engineering targets that can be combined with current ML pipelines. FluxRETAP captured 100% of reaction targets experimentally verified to improve Escherichia coli isoprenol production, 50% of targets that experimentally improved taxadiene production in E. coli and ∼60% of genetic targets from a verified minimal constrained cut-set in Pseudomonas putida, while providing additional high priority targets that could be tested. Overall, FluxRETAP is an efficient algorithm for identifying a prioritized list of testable genetic and reaction targets. AVAILABILITY AND IMPLEMENTATION: FluxRETAP is implemented in python and released under the creative commons license. The implementation and code are freely available at: https://github.com/JBEI/FluxRETAP.

Czajka, Jeffrey J↗

Automated model-predictive design of synthetic promoters to control transcriptional profiles in bacteria

Abstract Transcription rates are regulated by the interactions between RNA polymerase, sigma factor, and promoter DNA sequences in bacteria. However, it remains unclear how non-canonical sequence motifs collectively control transcription rates. Here, we combine massively parallel assays, biophysics, and machine learning to develop a 346-parameter model that predicts site-specific transcription initiation rates for any σ 70 promoter sequence, validated across 22132 bacterial promoters with diverse sequences. We apply the model to predict genetic context effects, design σ 70 promoters with desired transcription rates, and identify undesired promoters inside engineered genetic systems. The model provides a biophysical basis for understanding gene regulation in natural genetic systems and precise transcriptional control for engineering synthetic genetic systems.

42 ENGINEERING↗

Enhancing molecular design efficiency: Uniting language models and generative networks with genetic algorithms

This study examines the effectiveness of generative models in drug discovery, material science, and polymer science, aiming to overcome constraints associated with traditional inverse design methods relying on heuristic rules. Generative models generate synthetic data resembling real data, enabling deep learning model training without extensive labeled datasets. They prove valuable in creating virtual libraries of molecules for material science and facilitating drug discovery by generating molecules with specific properties. While generative adversarial networks (GANs) are explored for these purposes, mode collapse restricts their efficacy, limiting novel structure variability. To address this, we introduce a masked language model (LM) inspired by natural language processing. Although LMs alone can have inherent limitations, we propose a hybrid architecture combining LMs and GANs to efficiently generate new molecules, demonstrating superior performance over standalone masked LMs, particularly for smaller population sizes. This hybrid LM-GAN architecture enhances efficiency in optimizing properties and generating novel samples.

97 MATHEMATICS AND COMPUTING↗

Ocean feature recognition using genetic algorithms with fuzzy fitness functions (GA/F3)

A model for genetic algorithms with semantic nets is derived for which the relationships between concepts is depicted as a semantic net. An organism represents the manner in which objects in a scene are attached to concepts in the net. Predicates between object pairs are continuous valued truth functions in the form of an inverse exponential function (e sub beta lxl). 1:n relationships are combined via the fuzzy OR (Max (...)). Finally, predicates between pairs of concepts are resolved by taking the average of the combined predicate values of the objects attached to the concept at the tail of the arc representing the predicate in the semantic net. The method is illustrated by applying it to the identification of oceanic features in the North Atlantic.

Ankenbrandt, C. A.↗

A computational approach to the relationship between radiation induced double strand breaks and translocations

A theoretical framework is presented which provides a quantitative analysis of radiation induced translocations between the ab1 oncogene on CH9q34 and a breakpoint cluster region, bcr, on CH 22q11. Such translocations are associated frequently with chronic myelogenous leukemia. The theory is based on the assumption that incorrect or unfaithful rejoining of initial double strand breaks produced concurrently within the 200 kbp intron region upstream of the second abl exon, and the 16.5 kbp region between bcr exon 2 and exon 6 interact with each other, resulting in a fusion gene. for an x-ray dose of 100 Gy, there is good agreement between the theoretical estimate and the one available experimental result. The theory has been extended to provide dose response curves for these types of translocations. These curves are quadratic at low doses and become linear at high doses.

NASA Discipline Radiation Health↗

State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation

The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEGs), we truncate the state space by limiting the total molecular copy numbers in each MEG. We further describe a theoretical framework for analysis of the truncation error in the steady-state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of (1) the birth and death model, (2) the single gene expression model, (3) the genetic toggle switch model, and (4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady-state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate our theories. Overall, the novel state space truncation and error analysis methods developed here can be used to ensure accurate direct solutions to the dCME for a large number of stochastic networks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗