Regular expressions fusion using emergent computing

In this article is presented an approach for the comparison and establishment of patterns (motifs) from regular expressions that denote protein families, through the fusion of the sames. This task has a high computational cost, for this reason our approach uses a combinatorial optimization algorithm based on Ant Colonies to obtain the patterns that help the study and classification of families of protein chains. Particularly, we propose a system that can efficiently generate a pattern of the fusion of two regular expressions that describe protein chains, denoted in PROSITE language, in order to facilitate the analysis and classification of protein families from the structural point of view.