Table of Contents Author Guidelines Submit a Manuscript
Table of Contents Alerts

To receive news and publication updates for BioMed Research International, enter your email address in the box below.

BioMed Research International
Volume 2014 (2014), Article ID 563016, 6 pages
http://dx.doi.org/10.1155/2014/563016
Research Article

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

Evandro A. Marucci,1 Geraldo F. D. Zafalon,1 Julio C. Momente,1 Leandro A. Neves,1 Carlo R. Valêncio,1 Alex R. Pinto,2 Adriano M. Cansian,1 Rogeria C. G. de Souza,1 Yang Shiyou,3 and José M. Machado1

1Department of Computer Science and Statistics, Sao Paulo State University, Rua Cristóvão Colombo 2265, 15054-000 São José do Rio Preto, SP, Brazil
2Department of Control Engineering and Automation, Federal University of Santa Catarina, Rua Pomerode 710, 89065-300 Blumenau, SC, Brazil
3College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China

Received 12 February 2014; Accepted 2 July 2014; Published 22 July 2014

Academic Editor: Tzong-Yi Lee

Copyright © 2014 Evandro A. Marucci et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to Cite this Article

Evandro A. Marucci, Geraldo F. D. Zafalon, Julio C. Momente, et al., “An Efficient Parallel Algorithm for Multiple Sequence Similarities Calculation Using a Low Complexity Method,” BioMed Research International, vol. 2014, Article ID 563016, 6 pages, 2014. doi:10.1155/2014/563016