V. De Roberto, Jr., N.F.F. Ebecken, and E.R. Antonio (Brazil)
Genetic Algorithm, Conserved Regions, DNA, Drosophila
The conclusion of several sequencing projects provides a considerable data volume, apparently without any sense, that needs to be processed appropriately in order to obtain useful genetic information. This process includes several phases, where the first one corresponds to the analysis of the DNA (deoxyribonucleic acid) sequences with the purpose of looking for features to facilitate the recognition of the diverse component areas of this molecule. An important piece of data are the conserved sequences, i.e., sequences that repeat independent of the position in DNA. This data type can also help in the discovery of genetic regions. The search for this information becomes complex due to combinations that can exist when great data windows are treated in large databases, as they require a lot of memory and processing time. To solve this problem this paper presents a genetic algorithm based technique. This methodology imitates the natural selection process that has been applied successfully to several optimization problems. Therefore, this work has as its objective, with the aid of genetic algorithms, to find the best conserved sequences of nucleotides in a database, also presenting the used model, the experiments accomplished using a Drosophila melanogaster's database and our conclusions.
Important Links:
Go Back
