Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"evolutionary operations"”.

  1. On Gene Duplication

    … proposed is to determine the minimum number of evolutionary changes needed to transform one genome into another. In recent years, great progress has been made in this area with efficient exact algorithms that can transform one genome to another applying a wide range of evolutionary operations. …

    ottawa-retro Repository record for On Gene Duplication (opens in a new tab)

  2. Regression and Classification from Extinction

    Evolutionary Algorithms use the principles of natural selection and biological evolution to act as search and optimization tools. Two novel Spatially Structured Evolutionary Algorithms: the Multiple Worlds Model (MWM) and Multiple Agent Genetic Networks (MAGnet) are presented. These evolutionary …

    guelph Repository record for Regression and Classification from Extinction (opens in a new tab)

  3. Towards Better Turn-Based Strategy Planning Agents: Turn-Based Evolutionary Tree Search

    … Carlo Tree Search (MCTS) and Rolling Horizon Evolutionary Algorithms (RHEA) struggle to scale. First, we perform an investigation into state-of-the-art Deep Learning based models for game agents in TUBSTAP. Then, we propose Turn-Based Evolutionary Tree Search (TBETS), a novel hybrid algorithm …

    vt Repository record for Towards Better Turn-Based Strategy Planning Agents: Turn-Based Evolutionary Tree Search (opens in a new tab)

  4. Combinatorial optimization and application to DNA sequence analysis

    … early detection of diseases, and finding evolutionary relationships that exist among various organisms. Most sequence analysis problems arising from computational genomics and evolutionary biology fall into the class of NP-complete problems. Advances in exact and approximate algorithms to …

    gatech Repository record for Combinatorial optimization and application to DNA sequence analysis (opens in a new tab)

  5. Linear Programming and Integer Linear Programming in Bioinformatics

    … number of loss and duplication events in the evolutionary history from an unknown nearest common ancestor. In a labeled alignment, every unaligned gene must be labeled either as a loss or as the product of a duplication event. Once an optimal labeled alignment has been computed, a common …

    fu-berlin Repository record for Linear Programming and Integer Linear Programming in Bioinformatics (opens in a new tab)

  6. Data Mining with Newton's Method.

    … NM is compared to GAs and to the simplex evolutionary operation algorithm (EVOP). We find that GAs, NM, and EVOP all perform efficiently for well-behaved global optimization functions with NM providing an exponential improvement in convergence rate. For local optimization problems, we find …

    etsu Repository record for Data Mining with Newton's Method. (opens in a new tab) Download PDF for Data Mining with Newton's Method. (opens in a new tab)