摘要
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.
