An algorithm for the study of DNA sequence evolution based on the genetic code

DNA sequence reconstruction based on innovated hybridization technique of probabilistic cellular automata and particle swarm optimization

DNA sequence reconstruction is a challenging research problem in the computational biology field. The evolution of the DNA is too complex to be characterized by a few parameters. Therefore, there is a need for a modeling approach for analyzing DNA patterns. In this paper, we proposed a novel framework for DNA pattern analysis. The proposed framework consists of two main stages. The first stage is for analyzing the DNA sequences evolution, whereas the other stage is for the reconstruction process. We utilized cellular automata (CA) rules for analyzing and predicting the DNA sequence. Then, a modified procedure for the reconstruction process is introduced, which is based on the Probabilistic Cellular Automata (PCA) integrated with Particle Swarm Optimization (PSO) algorithm. This integration makes the proposed framework more efficient and achieves optimum transition rules. Our innovated model leans on the hypothesis that mutations are probabilistic events. As a result, their evolution can be simulated as a PCA model. The main objective of this paper is to analyze various DNA sequences to predict the changes that occur in DNA during evolution (mutations). We used a similarity score as a fitness measure to detect symmetry relations, which is appropriate for numerous extremely long sequences. Results are given for the CpG-methylation-deamination processes, which are regions of DNA where a guanine nucleotide follows a cytosine nucleotide in the linear sequence of bases. The DNA evolution is handled as the evolved colored paradigms. Therefore, incorporating probabilistic components help to produce a tool capable of foretelling the likelihood of specific mutations. Besides, it shows their capabilities in dealing with complex relations.

Reconstruction of DNA sequences using genetic algorithms and cellular automata: towards mutation prediction?

Change of DNA sequence that fuels evolution is, to a certain extent, a deterministic process because mutagenesis does not occur in an absolutely random manner. So far, it has not been possible to decipher the rules that govern DNA sequence evolution due to the extreme complexity of the entire process. In our attempt to approach this issue we focus solely on the mechanisms of mutagenesis and deliberately disregard the role of natural selection. Hence, in this analysis, evolution refers to the accumulation of genetic alterations that originate from mutations and are transmitted through generations without being subjected to natural selection. We have developed a software tool that allows modelling of a DNA sequence as a one-dimensional cellular automaton (CA) with four states per cell which correspond to the four DNA bases, i.e. A, C, T and G. The four states are represented by numbers of the quaternary number system. Moreover, we have developed genetic algorithms (GAs) in order to determine the rules of CA evolution that simulate the DNA evolution process. Linear evolution rules were considered and square matrices were used to represent them. If DNA sequences of different evolution steps are available, our approach allows the determination of the underlying evolution rule(s). Conversely, once the evolution rules are deciphered, our tool may reconstruct the DNA sequence in any previous evolution step for which the exact sequence information was unknown. The developed tool may be used to test various parameters that could influence evolution. We describe a paradigm relying on the assumption that mutagenesis is governed by a near-neighbour-dependent mechanism. Based on the satisfactory performance of our system in the deliberately simplified example, we propose that our approach could offer a starting point for future attempts to understand the mechanisms that govern evolution. The developed software is open-source and has a user-friendly graphical input interface.

The stochastic model of non-equilibrium mutagen-induced alterations of DNA: implication to genetic instability in cancer

Genetic alterations such as point mutations, chromosomal rearrangements, modification of DNA methylation and chromosome aberrations accumulate during the lifetime of an organism. They can be caused by intrinsic errors in the DNA replication and repair as well as by external factors such as exposure to mutagenic substances or radiation. The main purpose of the present work is to begin an exploration of the stochastic nature of non-equilibrium DNA alteration caused by events such as tautomeric shifts. This is done by modeling the genetic DNA code chain as a sequence of DNA-bit values ('1' for normal bases and '-1' for abnormal bases). We observe the number of DNA-bit changes resulting from the random point mutation process which, in the model, is being induced by a stochastic Brownian mutagen (BM) as it diffuses through the DNA-bit systems. Using both an analytical and Monte Carlo (MC) simulation techniques, we observe the local and global number of DNA-bit changes. It is found that in 1D, the local DNA-bit density behaves like 1/t, the global total number of the switched (abnormal) DNA-bit increases as t. The probability distribution P(b, 0, t) of b(0, t) is log-normal. It is also found that when the number of mutagens is increased, the number of the total abnormal DNA-bits does not grow linearly with the number of mutagens. All analytic results are in good agreement with the simulation results.