GeneLab: Conducting Genetic Research in Space: Using NASAs GeneLab genetic data to advance medical research
GeneLab overview with description of one type of analysis that GeneLab can be used to generate novel hypothesis.
Afshin Beheshti↗
SEARCH · Search NASA
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.
Disentangling genetic structure for genetic monitoring of complex populations
Explore the source record for details and available documents.
Brook G. Milligan↗
A Parallel Genetic Algorithm for Automated Electronic Circuit Design
Parallelized versions of genetic algorithms (GAs) are popular primarily for three reasons: the GA is an inherently parallel algorithm, typical GA applications are very compute intensive, and powerful computing platforms, especially Beowulf-style computing clusters, are becoming more affordable and easier to implement. In addition, the low communication bandwidth required allows the use of inexpensive networking hardware such as standard office ethernet. In this paper we describe a parallel GA and its use in automated high-level circuit design. Genetic algorithms are a type of trial-and-error search technique that are guided by principles of Darwinian evolution. Just as the genetic material of two living organisms can intermix to produce offspring that are better adapted to their environment, GAs expose genetic material, frequently strings of 1s and Os, to the forces of artificial evolution: selection, mutation, recombination, etc. GAs start with a pool of randomly-generated candidate solutions which are then tested and scored with respect to their utility. Solutions are then bred by probabilistically selecting high quality parents and recombining their genetic representations to produce offspring solutions. Offspring are typically subjected to a small amount of random mutation. After a pool of offspring is produced, this process iterates until a satisfactory solution is found or an iteration limit is reached. Genetic algorithms have been applied to a wide variety of problems in many fields, including chemistry, biology, and many engineering disciplines. There are many styles of parallelism used in implementing parallel GAs. One such method is called the master-slave or processor farm approach. In this technique, slave nodes are used solely to compute fitness evaluations (the most time consuming part). The master processor collects fitness scores from the nodes and performs the genetic operators (selection, reproduction, variation, etc.). Because of dependency issues in the GA, it is possible to have idle processors. However, as long as the load at each processing node is similar, the processors are kept busy nearly all of the time. In applying GAs to circuit design, a suitable genetic representation 'is that of a circuit-construction program. We discuss one such circuit-construction programming language and show how evolution can generate useful analog circuit designs. This language has the desirable property that virtually all sets of combinations of primitives result in valid circuit graphs. Our system allows circuit size (number of devices), circuit topology, and device values to be evolved. Using a parallel genetic algorithm and circuit simulation software, we present experimental results as applied to three analog filter and two amplifier design tasks. For example, a figure shows an 85 dB amplifier design evolved by our system, and another figure shows the performance of that circuit (gain and frequency response). In all tasks, our system is able to generate circuits that achieve the target specifications.
Long, Jason D.↗
An analysis of the metabolic theory of the origin of the genetic code
A computer program was used to test Wong's coevolution theory of the genetic code. The codon correlations between the codons of biosynthetically related amino acids in the universal genetic code and in randomly generated genetic codes were compared. It was determined that many codon correlations are also present within random genetic codes and that among the random codes there are always several which have many more correlations than that found in the universal code. Although the number of correlations depends on the choice of biosynthetically related amino acids, the probability of choosing a random genetic code with the same or greater number of codon correlations as the universal genetic code was found to vary from 0.1% to 34% (with respect to a fairly complete listing of related amino acids). Thus, Wong's theory that the genetic code arose by coevolution with the biosynthetic pathways of amino acids, based on codon correlations between biosynthetically related amino acids, is statistical in nature.
NASA Discipline Exobiology↗
An investigation of messy genetic algorithms
Genetic algorithms (GAs) are search procedures based on the mechanics of natural selection and natural genetics. They combine the use of string codings or artificial chromosomes and populations with the selective and juxtapositional power of reproduction and recombination to motivate a surprisingly powerful search heuristic in many problems. Despite their empirical success, there has been a long standing objection to the use of GAs in arbitrarily difficult problems. A new approach was launched. Results to a 30-bit, order-three-deception problem were obtained using a new type of genetic algorithm called a messy genetic algorithm (mGAs). Messy genetic algorithms combine the use of variable-length strings, a two-phase selection scheme, and messy genetic operators to effect a solution to the fixed-coding problem of standard simple GAs. The results of the study of mGAs in problems with nonuniform subfunction scale and size are presented. The mGA approach is summarized, both its operation and the theory of its use. Experiments on problems of varying scale, varying building-block size, and combined varying scale and size are presented.
Goldberg, David E.↗
Problem solving with genetic algorithms and Splicer
Genetic algorithms are highly parallel, adaptive search procedures (i.e., problem-solving methods) loosely based on the processes of population genetics and Darwinian survival of the fittest. Genetic algorithms have proven useful in domains where other optimization techniques perform poorly. The main purpose of the paper is to discuss a NASA-sponsored software development project to develop a general-purpose tool for using genetic algorithms. The tool, called Splicer, can be used to solve a wide variety of optimization problems and is currently available from NASA and COSMIC. This discussion is preceded by an introduction to basic genetic algorithm concepts and a discussion of genetic algorithm applications.
Bayer, Steven E.↗
Optimization of laminated stacking sequence for buckling load maximization by genetic algorithm
The use of a genetic algorithm to optimize the stacking sequence of a composite laminate for buckling load maximization is studied. Various genetic parameters including the population size, the probability of mutation, and the probability of crossover are optimized by numerical experiments. A new genetic operator - permutation - is proposed and shown to be effective in reducing the cost of the genetic search. Results are obtained for a graphite-epoxy plate, first when only the buckling load is considered, and then when constraints on ply contiguity and strain failure are added. The influence on the genetic search of the penalty parameter enforcing the contiguity constraint is studied. The advantage of the genetic algorithm in producing several near-optimal designs is discussed.
Le Riche, Rodolphe↗
Temporal Dependence of Chromosomal Aberration on Radiation Quality and Cellular Genetic Background
Radiation induced cancer risks are driven by genetic instability. It is not well understood how different radiation sources induce genetic instability in cells with different genetic background. Here we report our studies on genetic instability, particularly chromosome instability using fluorescence in situ hybridization (FISH), in human primary lymphocytes, normal human fibroblasts, and transformed human mammary epithelial cells in a temporal manner after exposure to high energy protons and Fe ions. The chromosome spread was prepared 48 hours, 1 week, 2 week, and 1 month after radiation exposure. Chromosome aberrations were analyzed with whole chromosome specific probes (chr. 3 and chr. 6). After exposure to protons and Fe ions of similar cumulative energy (??), Fe ions induced more chromosomal aberrations at early time point (48 hours) in all three types of cells. Over time (after 1 month), more chromosome aberrations were observed in cells exposed to Fe ions than in the same type of cells exposed to protons. While the mammary epithelial cells have higher intrinsic genetic instability and higher rate of initial chromosome aberrations than the fibroblasts, the fibroblasts retained more chromosomal aberration after long term cell culture (1 month) in comparison to their initial frequency of chromosome aberration. In lymphocytes, the chromosome aberration frequency at 1 month after exposure to Fe ions was close to unexposed background, and the chromosome aberration frequency at 1 month after exposure to proton was much higher. In addition to human cells, mouse bone marrow cells isolated from strains CBA/CaH and C57BL/6 were irradiated with proton or Fe ions and were analyzed for chromosome aberration at different time points. Cells from CBA mice showed similar frequency of chromosome aberration at early and late time points, while cells from C57 mice showed very different chromosome aberration rate at early and late time points. Our results suggest that relative biological effectiveness (RBE) of radiation are different for different radiation sources, for different cell types, and for the same cell type with different genetic background at different times after radiation exposure. Caution must be taken in using RBE value to estimate biological effects from radiation exposure.
Lu, Tao↗
Genetic algorithm based fuzzy control of spacecraft autonomous rendezvous
The U.S. Bureau of Mines is currently investigating ways to combine the control capabilities of fuzzy logic with the learning capabilities of genetic algorithms. Fuzzy logic allows for the uncertainty inherent in most control problems to be incorporated into conventional expert systems. Although fuzzy logic based expert systems have been used successfully for controlling a number of physical systems, the selection of acceptable fuzzy membership functions has generally been a subjective decision. High performance fuzzy membership functions for a fuzzy logic controller that manipulates a mathematical model simulating the autonomous rendezvous of spacecraft are learned using a genetic algorithm, a search technique based on the mechanics of natural genetics. The membership functions learned by the genetic algorithm provide for a more efficient fuzzy logic controller than membership functions selected by the authors for the rendezvous problem. Thus, genetic algorithms are potentially an effective and structured approach for learning fuzzy membership functions.
Karr, C. L.↗
Genetic algorithms
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.
Wang, Lui↗
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↗
Constraints in Genetic Programming
Genetic programming refers to a class of genetic algorithms utilizing generic representation in the form of program trees. For a particular application, one needs to provide the set of functions, whose compositions determine the space of program structures being evolved, and the set of terminals, which determine the space of specific instances of those programs. The algorithm searches the space for the best program for a given problem, applying evolutionary mechanisms borrowed from nature. Genetic algorithms have shown great capabilities in approximately solving optimization problems which could not be approximated or solved with other methods. Genetic programming extends their capabilities to deal with a broader variety of problems. However, it also extends the size of the search space, which often becomes too large to be effectively searched even by evolutionary methods. Therefore, our objective is to utilize problem constraints, if such can be identified, to restrict this space. In this publication, we propose a generic constraint specification language, powerful enough for a broad class of problem constraints. This language has two elements -- one reduces only the number of program instances, the other reduces both the space of program structures as well as their instances. With this language, we define the minimal set of complete constraints, and a set of operators guaranteeing offspring validity from valid parents. We also show that these operators are not less efficient than the standard genetic programming operators if one preprocesses the constraints - the necessary mechanisms are identified.
Janikow, Cezary Z.↗
JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms
A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking prevents these bugs from occurring, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology, and another paper in preparation.
Globus, Al↗
Combinatorial Multiobjective Optimization Using Genetic Algorithms
The research proposed in this document investigated multiobjective optimization approaches based upon the Genetic Algorithm (GA). Several versions of the GA have been adopted for multiobjective design, but, prior to this research, there had not been significant comparisons of the most popular strategies. The research effort first generalized the two-branch tournament genetic algorithm in to an N-branch genetic algorithm, then the N-branch GA was compared with a version of the popular Multi-Objective Genetic Algorithm (MOGA). Because the genetic algorithm is well suited to combinatorial (mixed discrete / continuous) optimization problems, the GA can be used in the conceptual phase of design to combine selection (discrete variable) and sizing (continuous variable) tasks. Using a multiobjective formulation for the design of a 50-passenger aircraft to meet the competing objectives of minimizing takeoff gross weight and minimizing trip time, the GA generated a range of tradeoff designs that illustrate which aircraft features change from a low-weight, slow trip-time aircraft design to a heavy-weight, short trip-time aircraft design. Given the objective formulation and analysis methods used, the results of this study identify where turboprop-powered aircraft and turbofan-powered aircraft become more desirable for the 50 seat passenger application. This aircraft design application also begins to suggest how a combinatorial multiobjective optimization technique could be used to assist in the design of morphing aircraft.
Crossley, William A.↗
Genetic Correlation with the DNA Repair Assay in Mice Exposed to High-LET
We hypothesize that DNA damage induced by high local energy deposition, occurring when cells are traversed by high-LET (Linear Energy Transfer) particles, can be experimentally modeled by exposing cells to high doses of low-LET. In this work, we validate such hypothesis by characterizing and correlating the time dependence of 53BP1 radiation-induced foci (RIF) for various doses and LET across 72 primary skin fibroblast from mice. This genetically diverse population allows us to understand how genetic may modulate the dose and LET relationship. The cohort was made on average from 3 males and 3 females belonging to 15 different strains of mice with various genetic backgrounds, including the collaborative cross (CC) genetic model (10 strains) and 5 reference mice strains. Cells were exposed to two fluences of three HZE (High Atomic Energy) particles (Si 350 megaelectronvolts per nucleon, Ar 350 megaelectronvolts per nucleon and Fe 600 megaelectronvolts per nucleon) and to 0.1, 1 and 4 grays from a 160 kilovolt X-ray. Individual radiation sensitivity was investigated by high throughput measurements of DNA repair kinetics for different doses of each radiation type. The 53BP1 RIF dose response to high-LET particles showed a linear dependency that matched the expected number of tracks per cell, clearly illustrating the fact that close-by DNA double strand breaks along tracks cluster within one single RIF. By comparing the slope of the high-LET dose curve to the expected number of tracks per cell we computed the number of remaining unrepaired tracks as a function of time post-irradiation. Results show that the percentage of unrepaired track over a 48 hours follow-up is higher as the LET increases across all strains. We also observe a strong correlation between the high dose repair kinetics following exposure to 160 kilovolts X-ray and the repair kinetics of high-LET tracks, with higher correlation with higher LET. At the in-vivo level for the 10-CC strains, we observe that drops in the number of T-cells and B-cells found in the blood of mice 24 hours after exposure to 0.1 gray of 320 kilovolts X-ray correlate well with slower DNA repair kinetics in skin cells exposed to X-ray. Overall, our results suggest that repair kinetics found in skin is a surrogate marker for in-vivo radiation sensitivity in other tissue, such as blood cells, and that such response is modulated by genetic variability.
cosmic radiation↗
Genetic Algorithm for Optimization of Neural Networks for Bayesian Inference of Model Uncertainty
The objective of this work was to develop a genetic optimization algorithm that can design a neural network capable of producing uncertainty estimates along with predictions. This algorithm is necessary because the inclusion of uncertainty modeling in a neural network greatly complicates the network’s design space, making the development of a converging model extremely difficult and time consuming. The genetic algorithm presented in this work uses a number of value ranges for various configurable neural network parameters to create a randomly generated population of network architectures. The initially generated population is then evolved over the course of several generations, with the best performing models breeding to produce novel network configurations. Mutations are randomly applied to the network designs to facilitate the development of adaptations beneficial to the task being performed. An experiment was conducted to validate the proposed algorithm, in which the genetic optimizer was tasked with producing a neural network capable of predicting the sound pressure level (SPL) resulting from jet-surface interaction (JSI) noise. The data used for this task was generated at the NASA Glenn Research Center in the Aero-Acoustic Propulsion Laboratory. Starting with an initial population size of 35 randomly generated networks, and evolved over the course of 10 generations, the genetic algorithm produced a design able to predict SPL as a result of JSI noise within 0.272 dB, on average.
Genetic algorithm↗
Comparison of genetic algorithms with conjugate gradient methods
Genetic algorithms for mathematical function optimization are modeled on search strategies employed in natural adaptation. Comparisons of genetic algorithms with conjugate gradient methods, which were made on an IBM 1800 digital computer, show that genetic algorithms display superior performance over gradient methods for functions which are poorly behaved mathematically, for multimodal functions, and for functions obscured by additive random noise. Genetic methods offer performance comparable to gradient methods for many of the standard functions.
Bosworth, J. L.↗
Genetic technology: Promises and problems
Issues concerning the use of genetic technology are discussed. Some areas discussed include treating genetic disease, prenatal diagnosis and selective abortion, screening for genetic disease, and genetic counseling. Policy issues stemming from these capabilities are considered.
Frankel, M. S.↗