An Efficient Parallel Algorithm for Multiple Sequence Similarities Calculation Using a Low Complexity Method

• Autor(a) principal: Marucci, Evandro A. [UNESP]
• Data de Publicação: 2014
• Outros Autores: Zafalon, Geraldo F. D. [UNESP], Momente, Julio C. [UNESP], Neves, Leandro A. [UNESP], Valencio, Carlo R. [UNESP], Pinto, Alex R., Cansian, Adriano M. [UNESP], Souza, Rogeria C. G. de [UNESP], Yang Shiyou, Machado, Jose M. [UNESP]
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UNESP
• Texto Completo: http://dx.doi.org/10.1155/2014/563016; http://hdl.handle.net/11449/117235

With the advance of genomic researches, the number of sequences involved in comparative methods has grown immensely. Among them, there are methods for similarities calculation, which are used by many bioinformatics applications. Due the huge amount of data, the union of low complexity methods with the use of parallel computing is becoming desirable. The k-mers counting is a very efficient method with good biological results. In this work, the development of a parallel algorithm for multiple sequence similarities calculation using the k-mers counting method is proposed. Tests show that the algorithm presents a very good scalability and a nearly linear speedup. For 14 nodes was obtained 12x speedup. This algorithm can be used in the parallelization of some multiple sequence alignment tools, such as MAFFT and MUSCLE.