Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “genetics”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

classLog: Logistic regression for the classification of genetic sequences

Introduction Sequencing and phylogenetic classification have become a common task in human and animal diagnostic laboratories. It is routine to sequence pathogens to identify genetic variations of diagnostic significance and to use these data in realtime genomic contact tracing and surveillance. Under this paradigm, unprecedented volumes of data are generated that require rapid analysis to provide meaningful inference. Methods We present a machine learning logistic regression pipeline that can assign classifications to genetic sequence data. The pipeline implements an intuitive and customizable approach to developing a trained prediction model that runs in linear time complexity, generating accurate output rapidly, even with incomplete data. Our approach was benchmarked against porcine respiratory and reproductive syndrome virus (PRRSv) and swine H1 influenza A virus (IAV) datasets. Trained classifiers were tested against sequences and simulated datasets that artificially degraded sequence quality at 0, 10, 20, 30, and 40%. Results When applied to a poor-quality sequence data, the classifier achieved between >85% to 95% accuracy for the PRRSv and the swine H1 IAV HA dataset and this increased to near perfect accuracy when using the full dataset. The model also identifies amino acid positions used to determine genetic clade identity through a feature selection ranking within the model. These positions can be mapped onto a maximum-likelihood phylogenetic tree, allowing for the inference of clade defining mutations. Discussion Our approach is implemented as a python package with code available at https://github.com/flu-crew/classLog .

Zeller, Michael A.↗
DOE OSTI2021

Stability Analysis of Parameter Varying Genetic Toggle Switches Using Koopman Operators

The genetic toggle switch is a well known model in synthetic biology that represents the dynamic interactions between two genes that repress each other. The mathematical models for the genetic toggle switch that currently exist have been useful in describing circuit dynamics in rapidly dividing cells, assuming fixed or time-invariant kinetic rates. There is a growing interest in being able to model and extend synthetic biological function for growth conditions such as stationary phase or during nutrient starvation. As cells transition from one growth phase to another, kinetic rates become time-varying parameters. In this paper, we propose a novel class of parameter varying nonlinear models that can be used to describe the dynamics of genetic circuits, including the toggle switch, as they transition from different phases of growth. We show that there exists unique solutions for this class of systems, as well as for a class of systems that incorporates the microbial phenomena of quorum sensing. Further, we show that the domain of these systems, which is the positive orthant, is positively invariant. We also showcase a theoretical control strategy for these systems that would grant asymptotic monostability of a desired fixed point. We then take the general form of these systems and analyze their stability properties through the framework of time-varying Koopman operator theory. A necessary condition for asymptotic stability is also provided as well as a sufficient condition for instability. A Koopman control strategy for the system is also proposed, as well as an analogous discrete time-varying Koopman framework for applications with regularly sampled measurements.

Harrison, Jamiree (ORCID:0000000265351579)↗
DOE OSTI2017

Change in Emiliania huxleyi Virus Assemblage Diversity but Not in Host Genetic Composition during an Ocean Acidification Mesocosm Experiment

Effects of elevated pCO₂ on Emiliania huxleyi genetic diversity and the viruses that infect E. huxleyi (EhVs) have been investigated in large volume enclosures in a Norwegian fjord. Triplicate enclosures were bubbled with air enriched with CO₂ to 760 ppmv whilst the other three enclosures were bubbled with air at ambient pCO₂ ; phytoplankton growth was initiated by the addition of nitrate and phosphate. E. huxleyi was the dominant coccolithophore in all enclosures, but no difference in genetic diversity, based on DGGE analysis using primers specific to the calcium binding protein gene ( gpa ) were detected in any of the treatments. Chlorophyll concentrations and primary production were lower in the three elevated pCO₂ treatments than in the ambient treatments. However, although coccolithophores numbers were reduced in two of the high- pCO₂ treatments; in the third, there was no suppression of coccolithophores numbers, which were very similar to the three ambient treatments. In contrast, there was considerable variation in genetic diversity in the EhVs, as determined by analysis of the major capsid protein ( mcp ) gene. EhV diversity was much lower in the high- pCO₂ treatment enclosure that did not show inhibition of E. huxleyi growth. Since virus infection is generally implicated as a major factor in terminating phytoplankton blooms, it is suggested that no study of the effect of ocean acidification in phytoplankton can be complete if it does not include an assessment of viruses.

Virology↗
DOE OSTI2016

Pyrrolysyl-tRNA Synthetase, an Aminoacyl-tRNA Synthetase for Genetic Code Expansion

Genetic code expansion (GCE) has become a central topic of synthetic biology. GCE relies on engineered aminoacyl-tRNA synthetases (aaRSs) and a cognate tRNA species to allow codon reassignment by co-translational insertion of non-canonical amino acids (ncAAs) into proteins. Introduction of such amino acids increases the chemical diversity of recombinant proteins endowing them with novel properties. Such proteins serve in sophisticated biochemical and biophysical studies both in vitro and in vivo, they may become unique biomaterials or therapeutic agents, and they afford metabolic dependence of genetically modified organisms for biocontainment purposes. In the Methanosarcinaceae the incorporation of the 22nd genetically encoded amino acid, pyrrolysine (Pyl), is facilitated by pyrrolysyl-tRNA synthetase (PylRS) and the cognate UAG-recognizing tRNAPyl. This unique aaRS•tRNA pair functions as an orthogonal translation system (OTS) in most model organisms. The facile directed evolution of the large PylRS active site to accommodate many ncAAs, and the enzyme’s anticodon-blind specific recognition of the cognate tRNAPyl make this system highly amenable for GCE purposes. The remarkable polyspecificity of PylRS has been exploited to incorporate >100 different ncAAs into proteins. Here we review the Pyl-OT system and selected GCE applications to examine the properties of an effective OTS.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1982

Genetic engineering possibilities for CELSS: A bibliography and summary of techniques

A bibliography of the most useful techniques employed in genetic engineering of higher plants, bacteria associated with plants, and plant cell cultures is provided. A resume of state-of-the-art genetic engineering of plants and bacteria is presented. The potential application of plant bacterial genetic engineering to CELSS (Controlled Ecological Life Support System) program and future research needs are discussed.

Johnson, E. J.↗
NASA NTRS1983

Experimental studies related to the origin of the genetic code and the process of protein synthesis - A review

A survey is presented of the literature on the experimental evidence for the genetic code assignments and the chemical reactions involved in the process of protein synthesis. In view of the enormous number of theoretical models that have been advanced to explain the origin of the genetic code, attention is confined to experimental studies. Since genetic coding has significance only within the context of protein synthesis, it is believed that the problem of the origin of the code must be dealt with in terms of the origin of the process of protein synthesis. It is contended that the answers must lie in the nature of the molecules, amino acids and nucleotides, the affinities they might have for one another, and the effect that those affinities must have on the chemical reactions that are related to primitive protein synthesis. The survey establishes that for the bulk of amino acids, there is a direct and significant correlation between the hydrophobicity rank of the amino acids and the hydrophobicity rank of their anticodonic dinucleotides.

Lacey, J. C., Jr.↗
NASA NTRS1990

The mGA1.0: A common LISP implementation of a messy genetic algorithm

Genetic algorithms (GAs) are finding increased application in difficult search, optimization, and machine learning problems in science and engineering. Increasing demands are being placed on algorithm performance, and the remaining challenges of genetic algorithm theory and practice are becoming increasingly unavoidable. Perhaps the most difficult of these challenges is the so-called linkage problem. Messy GAs were created to overcome the linkage problem of simple genetic algorithms by combining variable-length strings, gene expression, messy operators, and a nonhomogeneous phasing of evolutionary processing. Results on a number of difficult deceptive test functions are encouraging with the mGA always finding global optima in a polynomial number of function evaluations. Theoretical and empirical studies are continuing, and a first version of a messy GA is ready for testing by others. A Common LISP implementation called mGA1.0 is documented and related to the basic principles and operators developed by Goldberg et. al. (1989, 1990). Although the code was prepared with care, it is not a general-purpose code, only a research version. Important data structures and global variations are described. Thereafter brief function descriptions are given, and sample input data are presented together with sample program output. A source listing with comments is also included.

Goldberg, David E.↗
NASA NTRS1991

Distributed genetic algorithms for the floorplan design problem

Designing a VLSI floorplan calls for arranging a given set of modules in the plane to minimize the weighted sum of area and wire-length measures. A method of solving the floorplan design problem using distributed genetic algorithms is presented. Distributed genetic algorithms, based on the paleontological theory of punctuated equilibria, offer a conceptual modification to the traditional genetic algorithms. Experimental results on several problem instances demonstrate the efficacy of this method and indicate the advantages of this method over other methods, such as simulated annealing. The method has performed better than the simulated annealing approach, both in terms of the average cost of the solutions found and the best-found solution, in almost all the problem instances tried.

Cohoon, James P.↗
NASA NTRS1990

Weather prediction using a genetic memory

Kanaerva's sparse distributed memory (SDM) is an associative memory model based on the mathematical properties of high dimensional binary address spaces. Holland's genetic algorithms are a search technique for high dimensional spaces inspired by evolutional processes of DNA. Genetic Memory is a hybrid of the above two systems, in which the memory uses a genetic algorithm to dynamically reconfigure its physical storage locations to reflect correlations between the stored addresses and data. This architecture is designed to maximize the ability of the system to scale-up to handle real world problems.

Rogers, David↗
NASA NTRS1991

Training product unit neural networks with genetic algorithms

The training of product neural networks using genetic algorithms is discussed. Two unusual neural network techniques are combined; product units are employed instead of the traditional summing units and genetic algorithms train the network rather than backpropagation. As an example, a neural netork is trained to calculate the optimum width of transistors in a CMOS switch. It is shown how local minima affect the performance of a genetic algorithm, and one method of overcoming this is presented.

Janson, D. J.↗
NASA NTRS1993

The potential of genetic algorithms for conceptual design of rotor systems

The capabilities of genetic algorithms as a non-calculus based, global search method make them potentially useful in the conceptual design of rotor systems. Coupling reasonably simple analysis tools to the genetic algorithm was accomplished, and the resulting program was used to generate designs for rotor systems to match requirements similar to those of both an existing helicopter and a proposed helicopter design. This provides a comparison with the existing design and also provides insight into the potential of genetic algorithms in design of new rotors.

Crossley, William A.↗
NASA NTRS1994

Strain gage selection in loads equations using a genetic algorithm

Traditionally, structural loads are measured using strain gages. A loads calibration test must be done before loads can be accurately measured. In one measurement method, a series of point loads is applied to the structure, and loads equations are derived via the least squares curve fitting algorithm using the strain gage responses to the applied point loads. However, many research structures are highly instrumented with strain gages, and the number and selection of gages used in a loads equation can be problematic. This paper presents an improved technique using a genetic algorithm to choose the strain gages used in the loads equations. Also presented are a comparison of the genetic algorithm performance with the current T-value technique and a variant known as the Best Step-down technique. Examples are shown using aerospace vehicle wings of high and low aspect ratio. In addition, a significant limitation in the current methods is revealed. The genetic algorithm arrived at a comparable or superior set of gages with significantly less human effort, and could be applied in instances when the current methods could not.

Source record↗
NASA NTRS1994

Multidisciplinary design optimization using genetic algorithms

Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.

Unal, Resit↗
NASA NTRS1995

A hybrid genetic algorithm for resolving closely spaced objects

A hybrid genetic algorithm is described for performing the difficult optimization task of resolving closely spaced objects appearing in space based and ground based surveillance data. This application of genetic algorithms is unusual in that it uses a powerful domain-specific operation as a genetic operator. Results of applying the algorithm to real data from telescopic observations of a star field are presented.

Abbott, R. J.↗
NASA NTRS1995

Genetic algorithms as global random search methods

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that that schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solution and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

Peck, Charles C.↗
NASA NTRS1991

Genetic algorithm based input selection for a neural network function approximator with applications to SSME health monitoring

A genetic algorithm is used to select the inputs to a neural network function approximator. In the application considered, modeling critical parameters of the space shuttle main engine (SSME), the functional relationship between measured parameters is unknown and complex. Furthermore, the number of possible input parameters is quite large. Many approaches have been used for input selection, but they are either subjective or do not consider the complex multivariate relationships between parameters. Due to the optimization and space searching capabilities of genetic algorithms they were employed to systematize the input selection process. The results suggest that the genetic algorithm can generate parameter lists of high quality without the explicit use of problem domain knowledge. Suggestions for improving the performance of the input selection process are also provided.

Peck, Charles C.↗
NASA NTRS1995

Excursion-Set-Mediated Genetic Algorithm

Excursion-set-mediated genetic algorithm (ESMGA) is embodiment of method of searching for and optimizing computerized mathematical models. Incorporates powerful search and optimization techniques based on concepts analogous to natural selection and laws of genetics. In comparison with other genetic algorithms, this one achieves stronger condition for implicit parallelism. Includes three stages of operations in each cycle, analogous to biological generation.

Noever, David↗
NASA NTRS1995

Genetic algorithms as global random search methods

Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.

Peck, Charles C.↗