Related papers: Degeneracy in the genetic code and its symmetries …
A genetic algorithm is suitable for exploring large search spaces as it finds an approximate solution. Because of this advantage, genetic algorithm is effective in exploring vast and unknown space such as molecular search space. Though the…
The evolutionary biology of aging is fundamental to understanding the mechanisms of aging and how to develop anti-aging treatments. Thus far most evolutionary theory concerns the genetics of aging with limited physiological integration.…
Many people are familiar with the physico-chemical properties of gene sequences. In this paper I present a mathematical perspective: how do mathematical principles such as information theory, coding theory, and combinatorics influence the…
Many theories have been proposed to answer two questions on aging: "Why do we age?" and "How do we age?" Among them, evolutionary theories are proposed to interpret the evolutionary advantage of aging, and "saving resources for group…
Using concepts of physics of elementary particles concerning the breaking of symmetry and grannd unified theory we propose to study with the algebraic approximation the degeneracy finded in the genetic code with the incorporation of a…
A random-key genetic algorithm is an evolutionary metaheuristic for discrete and global optimization. Each solution is encoded as a vector of N random keys, where a random key is a real number randomly generated in the continuous interval…
Among the genetic algorithms generally used for optimization problems in the recent decades, quantum-inspired variants are known for fast and high-fitness convergence and small resource requirement. Here the application to the patient…
The present article is the first of a series whose goal is to define a logical formalism in which it is possible to reason about genetics. In this paper, we introduce the main concepts of our language whose domain of discourse consists of a…
How mutations accumulate in genomes is the central question of molecular evolution theories, however our understanding of this process is far from complete. Drake's rule is a notoriously universal property of genomes from microbes to…
In genetic drift of small population, it is well known that even when the ratio of alleles is 0.5, specific genes are fixed in or disappear from the population. It seems the reason why inbreeding is avoided. On the other hand, this…
Genetic algorithms are modeled after the biological evolutionary processes that use natural selection to select the best species to survive. They are heuristics based and low cost to compute. Genetic algorithms use selection, crossover, and…
This study proposes a data condensation method for multivariate kernel density estimation by genetic algorithm. First, our proposed algorithm generates multiple subsamples of a given size with replacement from the original sample. The…
Phylogenetic trees are simple models of evolutionary processes. They describe conditionally independent divergent evolution of taxa from common ancestors. Phylogenetic trees commonly do not have enough flexibility to adequately model all…
Here we propose an evolutionary algorithm that self modifies its operators at the same time that candidate solutions are evolved. This tackles convergence and lack of diversity issues, leading to better solutions. Operators are represented…
Inversions, also sometimes called reversals, are a major contributor to variation among bacterial genomes, with studies suggesting that those involving small numbers of regions are more likely than larger inversions. Deletions may arise in…
For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…
We present a model for evolving population which maintains genetic polymorphism. By introducing random mutation in the model population at a constant rate, we observe that the population does not become extinct but survives, keeping…
Over a quarter of century after the invention of genetic algorithms and miriads of their modifications, as well as successful implementations, we are still lacking many essential details of thorough analysis of it's inner working. One of…
Most genes are part of larger families of evolutionary related genes. The history of gene families typically involves duplications and losses of genes as well as horizontal transfers into other organisms. The reconstruction of detailed gene…
In the evolution of a genome, the gene sequence is sometimes rearranged, for example by transposition of two adjacent gene blocks. In biocombinatorics, one tries to reconstruct these rearrangement incidents from the resulting permutation.…