doi:

DOI: 10.3724/SP.J.1087.2013.03321

Journal of Computer Applications (计算机应用) 2013/33:12 PP.3321-3325

Parallelism of adaptive Hungary greedy algorithm for biomolecular networks alignment


Abstract:
Biomolecular networks alignment is an important field, and it is an effective way to study biomolecular phenomenon. Adaptive Hungary Greedy Algorithm (AHGA) is one of the valid biomolecular networks alignment algorithms. Commonly, biomolecular networks have large scale and biological background, so the data of biomolecular networks are special. In order to get the alignment results of biomolecular networks in acceptable time, considering the biological significance when aligning them, two methods including MPI (Message Passing Interface) and CUDA (Compute Unified Device Architecture) were used to parallelize the adaptive hybrid algorithm. The methods were analyzed and compared to find the suitable one for biomolecular networks alignment.

Key words:biomolecular networks alignment,adaptive,hybrid algorithm,parallelism

ReleaseDate:2014-07-21 16:59:37



PDF