Contact us
 |
[email protected] |
 |
3275638434 |
 |
 |
| Paper Publishing WeChat |
Useful Links
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Article
Author(s)
Raul Magdaleno Peñaloza, Andrea Magadan Salazar and Gerardo Reyes Salgado
Full-Text PDF
XML 491 Views
DOI:10.17265/2159-5275/2022.02.004
Affiliation(s)
Department of Computer Science, Centro de Investigacion y Desarrollo Tecnologico, Cuernavaca Morelos 62490, Mexico
ABSTRACT
This article shows genomic alignment methods using the classic “Needleman” and “Smith-Waterman” algorithms, the latter they were optimized by the ABC (artificial bee colony) algorithm. In the genomic alignment, a goal state is not presented, the experiments that are carried out show alternative alignments by ABC were proposed. Different types of alignments could exist within the classical algorithm, based on a horizontal, vertical, diagonal and inverse search mechanism on a match value table. Our ABC-Smith Waterman algorithm was generated from the genomic sequences written in rows and columns for the search for similarities that will provide values that ABC uses to process and provide more results of alignments that can be used by scientists for their experiments and research.
KEYWORDS
Algorithm, genomic alignment, ABC, Needleman, Smith-Waterman.
Cite this paper
References