BioMed Research International

BioMed Research International / 2014 / Article
Special Issue

High-Performance Computing and Big Data in Omics-based Medicine

View this Special Issue

Research Article | Open Access

Volume 2014 |Article ID 406178 |

Mohammed W. Al-Neama, Naglaa M. Reda, Fayed F. M. Ghaleb, "An Improved Distance Matrix Computation Algorithm for Multicore Clusters", BioMed Research International, vol. 2014, Article ID 406178, 12 pages, 2014.

An Improved Distance Matrix Computation Algorithm for Multicore Clusters

Academic Editor: Horacio Pérez-Sánchez
Received19 Jan 2014
Revised11 May 2014
Accepted18 May 2014
Published12 Jun 2014


Distance matrix has diverse usage in different research areas. Its computation is typically an essential task in most bioinformatics applications, especially in multiple sequence alignment. The gigantic explosion of biological sequence databases leads to an urgent need for accelerating these computations. DistVect algorithm was introduced in the paper of Al-Neama et al. (in press) to present a recent approach for vectorizing distance matrix computing. It showed an efficient performance in both sequential and parallel computing. However, the multicore cluster systems, which are available now, with their scalability and performance/cost ratio, meet the need for more powerful and efficient performance. This paper proposes DistVect1 as highly efficient parallel vectorized algorithm with high performance for computing distance matrix, addressed to multicore clusters. It reformulates DistVect1 vectorized algorithm in terms of clusters primitives. It deduces an efficient approach of partitioning and scheduling computations, convenient to this type of architecture. Implementations employ potential of both MPI and OpenMP libraries. Experimental results show that the proposed method performs improvement of around 3-fold speedup upon SSE2. Further it also achieves speedups more than 9 orders of magnitude compared to the publicly available parallel implementation utilized in ClustalW-MPI.

1. Introduction

Distance matrix (DM) refers to a two-dimensional array containing the pairwise distances of a set of elements. DM has a broad range of usage in various scientific research fields. It is used intensively in data clustering [1], pattern recognition [2], image analysis [3], information retrieval [4], and bioinformatics. In bioinformatics, it is mainly used in constructing the so-called phylogenetic tree, which is a diagram that depicts the lines of evolutionary descent of different species, organisms, or genes from a common ancestor [5].

The explosive growth of genomes makes the ability to align a huge number of long sequences become more essential. For example, the Ribosomal Database Project Release 10 [6] consists of more than million sequences. This leads to the massive number of distance calculations. As, for just aligning 100,000 sequences, approximately 5 billion distances need to be computed to construct a complete DM. Even if the sequences are short and pairwise distance calculations can be done relatively quickly, say at a rate of ., their alignment still requires almost 12 days of CPU time. Another difficulty is how to store the DM elements, as it will take up to 40 GB of memory. This leads to the need of new approaches to accelerate the distance calculations and to handle storage efficiently.

On the other hand, the rapid development of high performance computing (HPC) hardware provides high-performance cost ratio computational capability. The high precisions of multicore computers, clusters, and grids have become increasingly available and more powerful nowadays [7]. Therefore, it is of interest to use high-performance technologies to unlock the potential of such systems. Meanwhile, parallel programming libraries such as OpenMP and MPI made it possible for programmers to take advantage of the great computational capability of multicore and clusters for general purpose usage.

Many attempts have been produced to efficiently compute the distance matrix. As seen in the next section, the ones that used GPUs are really fast but the length of sequences is limited. Other methods that can handle long sequences and produce accurate alignment are relatively slow. Our motivation is to provide an efficient method that combines the speed and the ability to align long sequences.

This paper is an extension to our work in [8]. An improved version of DistVect algorithm is proposed. The computations are redistributed efficiently to manage the load imbalance aiming at enhancing the overall performance. The algorithm has been upgraded to the hybrid model so as to reap the maximum benefits of fine- and coarse-grained models. The proposed method is devoted to multicore clusters due to its popularity nowadays and is for achieving higher processing speed.

The main contributions of this paper are:(i)designing a highly parallel extended DistVect algorithm for distance matrix computation on multicore clusters, called DistVect1, to align huge sequences fast,(ii)implementing the proposed DistVect1 algorithm using C++ with MPI and OpenMP on Bibliotheca Alexandrina platform,(iii)carrying out comprehensive experiments using a wide variety of real dataset sizes and showing that our developed program outperforms both ClustalW-MPI and SSE2 in terms of execution time,(iv)investigating the impact of increasing both the number and the length of sequences on the speedup and demonstrating that DistVect1 yields significant speedup when the length of genomes increases.

The rest of this paper is organized as follows. Section 2 summarizes briefly the fundamental methods and algorithms concerning the distance matrix. Section 3 explains the DistVect algorithm. Section 4 discusses the improved DistVect1. Section 5 describes the implementation procedure briefly and presents results with a detailed analysis. Finally, Section 6 concludes the paper and suggests future work.

Distance matrix computation is considered as the substantial stage of most multiple sequence alignment tools. To align a dataset of size , where is the number of sequences and is their average length, the computation of the DM elements requires pairwise comparisons. Each comparison uses a matrix of size to obtain the distance. These computations can become prohibitive when and are very large (i.e., in the tens of thousands). There are few multiple alignment programs that handle datasets of this size, with acceptable accuracy, such as MAFFT [9], DIALIGN [10], and Clustal [11]. Most accurate methods could only routinely handle hundreds or few thousands of sequences, like MUSCLE [12], Probcoms [13], and T-Coffee [14].

Promising solutions have been found for parallelizing DM calculations. Various parallel algorithms were presented to overcome speed/space obstacles for different HPC systems such as multiprocessor machines and workstation clusters. One category focuses on parallelizing the operations on smaller data components. Typical implementations of this approach using multithreading are in [15, 16]. The others concentrate on distributing each independent pair of sequences on different processors. The most popular parallel method that uses this approach is ClustalW-MPI [17]. It is targeted for workstation clusters with distributed memory architecture. Its main contribution was providing an efficient distributed memory implementation of ClustalW that can be run on a wide range of distributed memory PC clusters and parallel multicomputers.

Wirawan et al. exploit in [18] the use of an intertask approach, with SIMD model. They take advantage of the fact that all elements in the same minor diagonal can be computed independently in parallel. They used common Intel processors with the SSE2 instruction set, supporting 16-bit elements, and produced a software tool called SSE2, which was mainly written in C with p-thread API. This approach has been exploited in some recent methods [15, 1921] where parallelism occurs within a single pair of sequences, to avoid data dependencies within the alignment matrix.

GPU has been used in [22] to accelerate sequence alignment. It has reformulated dynamic programming-based alignment algorithms as streaming algorithms in terms of computer graphics primitives. Experimental results show that the GPU-based approach allows speedups of over one order of magnitude with respect to optimized CPU implementations. Nevertheless, this is not severe since 99.8 percent of the sequences in the database are of length <4,096. Furthermore, it is reasonable to expect that the allowed texture buffer sizes will increase in next-generation graphics hardware.

Also, CUDASW++ [20] parallelizes Smith-Waterman algorithm for CUDA GPU that computes the similarity scores of a query sequence paired with each sequence in a database. Performance analysis shows substantial improvement to the overall performance on the order of three to four giga-cell updates per second. The single-GPU version achieves an average performance of 9.509 GCUPS with a lowest performance of 9.039 GCUPS and a highest performance of 9.660 GCUPS, and the dual-GPU version achieves an average performance of 14.484 GCUPS with a lowest performance of 10.660 GCUPS and a highest performance of 16.087 GCUPS. But it supports query sequences of length up to 59 K and for query sequences ranging in length from 144 to 5,478.

This approach has been further explored by its authors resulting in optimized SIMT and partitioned vectorized algorithm CUDASW++ 2.0 [19] with an astonishing performance of up to 17 GCUPS on a GeForce GTX 280 and 30 GCUPS on a dual-GPU GeForce GTX 295.

Likewise, CUDASW++ 3.0 [21] couples CPU and GPU SIMD instructions and carries out concurrent CPU and GPU computations. It employs SSE-based vector execution units as accelerators and employs CUDA PTX SIMD video instructions to gain more data parallelism beyond the SIMT execution model. Evaluation shows that CUDASW++ 3.0 gains a performance improvement over CUDASW++ 2.0 up to 2.9 and 3.2, with a maximum performance of 119.0 and 185.6 GCUPS, on a single-GPU GeForce GTX 680 and a dual-GPU GeForce GTX 690 graphics card, respectively. It also has demonstrated significant speedups over SWIPE and BLAST+. However, the longest query sequence was of length 5,478 to search against the Swiss-Prot protein databases that have the largest sequence length 35,213.

However, most of GPU implementations cannot align sequences longer than 59,000 residues. This is due to the intrinsic SIMD characteristics of the GPG, where pipelining allows a great speedup factor, yet intense memory usage may lead to bottlenecks. This leads to the deployment of other architectures such as many-cores [23]. MC64-ClustalWP2 has been developed recently as a new implementation of the ClustalW algorithm, to align long sequences in architectures with many cores. It runs multiple alignments 18 times faster than the original ClustalW algorithm and can align sequences that are relatively long (more than 10 kb).

Authors proposed a vectorized distance matrix computation algorithm called DistVect [8]. The algorithm addresses the problem of building a parallel tool for multicores that produces the alignment of multiple sequences in a short time without using much storage space. The main contribution was the vectorization of all used matrices in computation. Experimentally, the proposed method achieved good ability of aligning large number of sequences through powerful improved storage handling capabilities with efficient improvement of the overall processing time.

3. DistVect Algorithm

DistVect [8] is an accelerated algorithm that computes the distance matrix for aligning huge datasets. It has the advantage of exhausting less space. It takes, as input , sequences of average length , with their substitution matrix sbt and the gab cost . It outputs a distance vector, , containing the similarity score (distance) for each of the two sequences. It works on vectorizing matrices presented by Liu et al. in [22] and used by Wirawan et al. in [18]. It parallelizes the computations of resolving vectors, taking in account the advantage of the independence of the elements of the minor diagonals of the matrices.

To compute the number of exact matches and make it suitable for a fine-grained parallel implementation, Liu et al. [22] formulated a recurrence relation for the number of exact match computations that is more suitable for implementation using a linear gap penalty. This formula facilitates the calculations without computation of the actual alignment. Given two sequences and of lengths and , the distances are computed using the matrices as shown below: where and .

In [8], the authors proved mathematically that the above equations can be transformed to the following equations using vectors only: where is the highest score of , which indicates the number of exact matches in the optimal local alignment, , , , is average lengths, and , are the exact match values in each iteration.

The main idea was based on the fact that any element in an antidiagonal of needs only the values of three elements from the previous two antidiagonals. This leads to the fact that only three vectors could be sufficient. One vector, , is used as a current vector and the previously calculated vectors, and , as buffers. Also three vectors, , and , substitute matrix . Finally, the distance matrix, , is replaced by a distance vector . Each element is evaluated in terms of the highest score, . Figure 1 shows DistVect methodology when aligning two sample sequences of length 8.

4. Proposed Algorithm

Although DistVect implementation on a multicore using OpenMp and multithreading has achieved good speedup compared to ClustalW-MPI [17], it shows load unbalancing. To overcome this problem, we propose using a better computation partitioning technique and accompanying extensions to operate on recent available clusters system that offers more power to parallelism. This is done in order to enhance the performance. In this section, an improved version of DistVect is proposed.

DistVect computes the similarity scores using only three vectors instead of the matrix DM using fine-grained parallelism and multithreading. It distributes all cells’ computations of the antidiagonal vector, , over the available cores. The value of each cell is evaluated in terms of its diagonal neighbor stored at , with its left and upper neighbors stored at , and the maximum value is selected indicating the highest score (see Figure 1).

When analyzing the data dependencies between computations, it appears that it may be decomposed through three distinct approaches.(i)First, the fine-grain approach, like multithreaded ClustalW [16], is the one in which the computations of each similarity matrix are decomposed. The implementation of this approach in our work [8] shows high sensitivity to the length of sequences and an imbalanced workload among CPU cores.(ii)Second, the coarse-grain approach partitions DM into blocks (tiles) and assigns the computation of each one to a node, as in [17, 24]. However, this approach is good only when the number of sequences is too large compared to their length and vice versa.(iii)Third, the hybrid approach (which is used in the proposed algorithm) combines the two previous approaches to benefit from the strong points of both of them.

As mentioned above, DistVect algorithm faces some performance challenges when applying the fine-grain approach. The reason is that the size of the vector, , varies during the computation, and the number of cells to be computed at each iteration step is not the same. Thus, when we distribute the cells on the diagonal to cores, we notice that the workload is not well balanced among cores. That is because the number of cells is not always divisible by . Therefore, at each step, some cores have idle time, leading to work overhead on other cores. Consider Figure 1; at iteration 1 () only core 1 works; at iteration 2 () only cores 1 and 2 work. While at iterations 6 and 9 () cores 1 and 2 compute two cells, cores 3 and 4 compute one cell only. Therefore, not all cores compute the same number of cells.

On the other hand, we think this computation model requires a large number of cores for aligning real biological data. That is because our main contribution is based on the acceleration of similarity score computation which is a function of the sequences’ length . And we concentrate on dealing with long sequences, but each core calculates one element of at a time. Thus, as the number of cores increases, the parallelization factor will increase, leading to a higher acceleration.

Figure 2 demonstrates our proposed cyclic partitioning technique, when handling the two sequences considered at Figure 1 with 4 cores. The four cores act in parallel on each of the first four consecutive rows; then they sequentially act on the second consequent 4 rows.

Furthermore, all distance computations are partitioned into splits and distributed over the nodes in the cluster system. All nodes work in parallel. Each node will operate sequentially on aligning the set of pairs at its own split, whose size is . Figure 3 explains how the alignments of 4 sequences of length 8 are scheduled over a cluster system of 2 nodes; each node has 4 cores. In this case, there are 2 splits; each split is of size 3.

The pseudocode of this proposed method is depicted in Algorithm 1. And the distance vector DV is computed using the following modified recurrences: where .

Input: Number of sequences N, average sequences’ length L, sequences’ dataset
, substitution matrix sbt, gab cost g, Number of Nodes M,
Number of cores P
Output: Distance Vector DV
(1) Let
(2) Let
(3)                 Distributing splits over M nodes
(4) for do in parallel
(5)  Identify Split
(6)  for do
(7)   Get and from Split
(8)   Initialize and
(9)   for do
(10)           Distributing distance computation over P cores
(11)    for do in parallel
(12)     Compute using (3)
(13)     if then Let
(14)     else Let
(15)     end if
(16)     Compute using (4)
(17)    end for
(18)    Let and
(19)    Let and
(20)   end for
(21)   Identify
(22)   Let
(23)   Increment
(24) end forPairs
(25) end forNodes
(26) return DV

5. Performance Evaluation

The proposed algorithm DistVect1 has been implemented in C++, using OpenMP and MPI libraries. The introduced hybrid paradigm matches the characteristics of a cluster of multicore system very well. The resulting program has the advantage of coarse-grained parallelism on process level, in which each MPI process is executed on one multicore node. Also, it has the advantage of fine-grained parallelism on a loop level, in which each MPI process spawns a team of threads to occupy the multicore processors when encountering parallel sections of code using OpenMP. However, the obtained results should be carefully analyzed in order to realize the set of items that interfere with the established comparison model.

5.1. Experimental Setup

The presented program has been implemented on Sun Microsystems cluster, provided by LinkSCEEM-2 systems at Bibliotheca Alexandrina, Egypt.

This platform specification is as follows:(i)130 nodes and 64 GB memory (the allowed number of nodes for one user is 32 nodes): each node contains two Intel quad core Xeon 2.83 GHz processors (64-bit technology),(ii)8 Gbyte RAM, 80 Gbyte hard disk, and a dual port in fin band (10 Gbps),(iii)a Giga Ethernet Network port: the operating system is 64-bit Linux.

Real protein sequences of different lengths were used for computation. They are available online at NCBI [25]. They comprise a subset of variant family of viruses. Each used benchmark dataset with the average sequence length and the standard deviation is given in Table 1. The standard deviation gives us a numerical measure of the scatter of a dataset. This measure is useful for making comparisons between datasets that go beyond simple visual impressions.

Benchmark Number of sequences Average length Standard deviation

Human immunodeficiency virus (HIV) 3,000 858 10.745
6,000 858 14.632

HA hemagglutinin (influenza B virus) 2,000 1,741 32.604
4,000 1,728 36.661

Several viruses within the Coronaviridae family 200 30,488 908.534
500 29,414 1,066.417

Herpesviridae (large family of DNA viruses) 20 163,654 47,330.32
50 161,000 42,899.81

Comprehensive experiments have been conducted on the specified platform using different groups of sequences selected from the indicated datasets. They evaluated the implementation of DistVect1 versus that of DistVect and two popular efficient programs:(i)ClustalW-MPI available at,(ii)SSE available at

For SSE2 program, we have used the SSE approach within each MPI process after distributing the overall workload using the proposed scheduling technique, as clarified at Figure 3. Thus, each node applies its multithreading approach on its assigned matrices, one at a time. Bibliotheca Alexandria used platform support Advanced Vector Extensions (AVX), which is used during implementing SSE2 code.

5.2. Execution Time, Speedup, and Efficiency

In this subsection, three common performance measurements, the execution time, the speedup, and the efficiency, are used. Parallel execution time represents the elapsed time for complete computation of the distance matrix, including all additions, comparisons, and maximum operations. Parallel speedup is evaluated by the ratio between the parallel execution time of the two involved programs. Parallel efficiency is computed by dividing the corresponding parallel speedups by the number of cores. Results for variable number of available nodes with their analysis are presented below.

As a start, experiments were executed on a single node with 8 cores. Since the amount of computations required for a sequence depends on its length, multiple lengths of sequences from HIV, Coronaviridae, and HA haemagglutinin were tested. The execution time (in seconds) of the proposed DistVect1 implementation against ClustalW-MPI and DistVect was recorded. Figure 4(a) shows how the performance of N(L) is affected by the sequences’ number, , and length, . DistVect1 shows slightly higher performance than that of the two other programs when ranges in the hundreds and ranges in the thousands. Further, it presented superior performance when is small compared to , and exceeds a thousand. As shown in Figure 4(b), the maximum achieved speedups when comparing set 500(9,200) were and .

Next, variant subsets of the specified dataset with different sizes were tested on 8 nodes. Figure 5 shows that ClustalW-MPI could not handle long sequences with overriding thirty thousand. That is because ClustalW-MPI approach strongly depends on the number of sequences and focuses on the distribution of sequences across nodes without regarding their length. Also, DistVect and SSE2 concentrate on the thread level parallelism approach which is based on . As a result, our program performed better than the three programs in all cases and operated smoothly with very long sequences. This accomplishment is due to the perfect vectorization and hybrid partitioning approaches. For example, for comparing set 200(30,488), ClustalW-MPI did not work, DistVect1 consumed 23,467 sec., SSE2 exhausted 22,949 sec., and DistVect1 achieved it in 8,017 sec.

Also, the same dataset was tested on 16 nodes. Results given in Figure 6 demonstrate that as the number of nodes increases, the performance upgrades. For example, compared to the same set, 200(30,488), ClustalW-MPI works but slowly takes 26,824 sec.; DistVect consumed better time, 12,955 sec.; SSE2 exhausted less period, 8166 sec.; and DistVect1 presents the fastest achievement, 3,226 sec.

Finally, when tests were performed on 32 nodes, as seen in Figure 7, DistVect1’s overall performance is typically much better when compared to other programs. In fact, it exhibits its superiority when is in tens of thousands. The maximum speedup for set 20(163,354) was up to 9, 3, and 2 with respect to the ClustalW-MPI, SSE2, and DistVect, respectively.

To ensure that DistVect1 execution time decreases as the number of nodes increases, Figure 8 illustrates the relation between the execution time and the number of nodes. As a consequence, it is concluded that DistVect1 implementation acts almost monotonically, increasing whenever the number of available nodes increases. Therefore, we can state that DistVect1 execution time is inversely in proportion to the number of nodes.

To emphasize that the proposed DistVect1 program is more efficient than other implemented programs, the parallel efficiency in terms of the maximum number of available cores has been evaluated. Results are recorded in Table 2. It is clear that DistVect1 efficiency is monotonically increasing as the length of sequences increases. Thus, we can state that DistVect1 efficiency is directly in proportion to the sequences’ length. In addition, DistVect1’s supreme efficiency was up to 0.29, 0.086, and 0.092 with respect to the ClustalW-MPI, SSE2, and DistVect, respectively, for the longest sequence length (163 k).

Number of sequences (Length of sequence) ClustalW-MPI SSE2 DistVect

6,000 (858) 0.1899 0.0401 0.0642
3,000 (858) 0.2025 0.0414 0.0625
2,000 (1,750) 0.2087 0.0436 0.0677
4,000 (1,750) 0.2061 0.0449 0.0696
200 (30,500) 0.2578 0.0881 0.0910
50 (161,000) 0.2730 0.0823 0.0919
20 (163,650) 0.2901 0.0863 0.0919

5.3. GCUPS

A performance measurement commonly used in computational biology is billion cell updates per second (GCUPS). A GCUPS represents the time for a complete computation of one entry in the similarity matrix, including all comparisons additions and maximum operations. We have scanned the datasets with their average length as mentioned above. Our implementation on a cluster of multicores allows handling sequences up to a length of 163 k. Table 3 compares the corresponding GCUPS performance values.

Number of sequences (Length of sequence) DistVect1 DistVect SSE2 ClustalW-MPI

20 (163,650) 2.32 0.79 0.84 0.25
2,000 (1,750) 5.82 2.68 4.17 0.87
4,000 (1,750) 6.27 2.81 4.36 0.95
3,000 (858) 6.66 3.33 5.03 1.03
6,000 (858) 6.69 3.26 5.22 1.10
200 (30,500) 11.69 4.01 4.15 1.42
50 (161,000) 7.03 2.39 2.67 0.80
500 (30,000) 10.75 3.92 3.85 0.00

5.4. Space Reduction

The huge growth of sequence databases that exceed current programs’ capability and computer systems capacity gives rise to the importance of considering space complexity as an intrinsic performance metric. In the following, we study the exhausted storage space as a function of , the sequence length, and , the number of sequences. DistVect1 has reduced the overall consumed space by other programs in two ways.(i)The compensation of the distance matrix, DM, by the distance vector, , reduces space from into , that is, almost to the half, as shown in Table 4.(ii)The substitution of matrices and by vector V’s and three reduces space from to , as shown in Table 5.

N 20 50 200 500 2,000 3,000 4,000 6,000
DM 0.0004 0.0025 0.04 0.25 4 9 16 36
DV 0.00019 0.001225 0.0199 0.12475 1.999 4.49 7.99 17.998

L 858 1,728 29,414 161,000
H’s + N’s 1.475 5.97 173.48 518
V’s + ’s 0.005 0.01 0.176 0.966

5.5. Load Balancing and Occupancy

To study the occupancy of processors and memory, real snapshots have been taken as seen in Figure 9. They record the history of CPUs, memory, and network during execution. They demonstrate how different proposed versions of the algorithm improve load balancing and memory bandwidth. The load unbalancing of DistVect is apparent in Figure 9(a). On the contrary, the optimal load balancing of DistVect1, with the full use of all CPUs by 100%, is obvious. Also, the reduction of memory occupancy is very clear in Figure 9(b).

As a conclusion, a comparison of DistVect1 proposed method with studied GPU and cluster implementations discussed in this paper is illustrated in Table 6. For each program, it specifies its platform and records the maximum sequence length that may be handled, the highest speedup, and GCUPS which can be reached. Records certify our presumed idea that although GPU programs are very fast with high GCUPS, they cannot align long sequences. It also proves that our proposal is superlative in handling long sequences with good speedup.

Software Platform Maximum sequence length Highest GCUPS Highest speedup

CUDASW++ 2 Dual-GPU GeForce GTX 295 59 k 28 (144–5478) 1.78 with (CUDASW++ 1.0)
CUDASW++ 3 Dual-GPU GeForce GTX 690 59 k 185.60 (144–5478) 3.2 with (CUDASW++ 2.0)
MC64-ClustalWP2 Intel Xeon Quad Core 300 k 0.92 7.76 with (ClustalW-MPI)
SSE2 Cell/BE 0.858 k 0.0058 76.20 with ClustalW sequential
ClustalW-MPI PC cluster 1100 0.07 14.5 with ClustalW sequential
DistVect1 Cluster of multicores 163 k 11.69 9.2 with (ClustalW-MPI)

The above presented results reveal the best performance of the DistVect1 against other implementations. This achievement is due to two main reasons: the superiority of DistVect1 in using vectors instead of matrices, leading to a better caching, and the optimal use of multicore cluster system because of the proposed partitioning and scheduling techniques, especially when the length of sequences increases, thus obtaining a higher parallelization factor.

6. Conclusion and Future Work

In this paper, we presented and evaluated DistVect1 algorithm, an improved version of the vectorized parallel algorithm DistVect, for efficiently computing the distance matrix using multicore cluster systems. The new suggested partitioning and scheduling approaches, integrated with MPI and OpenMP primitives, have achieved a significant improvement to the overall performance. Implementations were conducted on Bibliotheca Alexandria cluster system using 32 nodes (8 cores).

The resulting program, DistVect1, was able to compute distances between very long sequences, up to 163 k. It outperforms SSE2 with 3-fold speedup and ClustalW-MPI 0.13 with 9-fold speedup. Its efficiency reaches 0.29, 0.086, and 0.092 over the ClustalW-MPI, SSE2, and DistVect, respectively. Moreover, it accomplishes 100% of CPUs occupancy with optimal load balancing and less memory exhaustion. The performance figures also vary from a low of 6.27 GCUPS to a high of 11.69 GCUPS as the lengths of the query sequences increase from 1,750 to 30,500. We believe that, if more cores are provided, a better performance will be achieved and a higher speedup with improved efficiency will be accomplished.

For future work, it is planned to develop an efficient multiple sequence alignment tool as an extension to the proposed work. Furthermore, it is expected to exploit the proposed parallel program for providing better solutions for a class of widely encountered problems in bioinformatics and image processing.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.


The authors would like to thank Bibliotheca Alexandria for granting the access for running their computations on its platform. This work has been accomplished with the aid of proficient discussions and technical support of the Supercomputer laboratory team members at Bibliotheca Alexandria, Egypt.


  1. C.-E. Chin, A. C.-C. Shth, and K.-C. Fan, “A novel spectral clustering method based on pairwise distance matrix,” Journal of Information Science and Engineering, vol. 26, no. 2, pp. 649–658, 2010. View at: Google Scholar
  2. R. Hu, W. Jia, H. Ling, and D. Huang, “Multiscale distance matrix for fast plant leaf recognition,” IEEE Transactions on Image Processing, vol. 21, no. 11, pp. 4667–4672, 2012. View at: Publisher Site | Google Scholar
  3. A. Roman-Gonzalez, “Compression techniques for image processing tasks,” International Journal of Advanced Research in Computer Science and Software Engineering, vol. 3, no. 7, pp. 379–388, 2013. View at: Google Scholar
  4. J. Venna, J. Peltonen, K. Nybo, H. Aidos, and S. Kaski, “Information retrieval perspective to nonlinear dimensionality reduction for data visualization,” Journal of Machine Learning Research, vol. 11, pp. 451–490, 2010. View at: Google Scholar
  5. A. Y. Zomaya, Parallel Computing for Bioinformatics and Computational Biology: Models, Enabling Technologies, and Case Studies, John Wiley & Sons, 2006.
  6. J. R. Cole, Q. Wang, E. Cardenas et al., “The Ribosomal Database Project: improved alignments and new tools for rRNA analysis,” Nucleic Acids Research, vol. 37, no. 1, pp. D141–D145, 2009. View at: Publisher Site | Google Scholar
  7. B. Schmidt, Bioinformatics: High Performance Parallel Computer Architectures, CRC Press, 2011.
  8. M. W. Al-Neama, N. M. Reda, and F. F. M. Ghaleb, “Fast vectorized distance matrix computation for multiple sequence alignment on multi-cores,” International Journal of Biomathematics. In press. View at: Google Scholar
  9. K. Katoh, K.-I. Kuma, H. Toh, and T. Miyata, “MAFFT version 5: improvement in accuracy of multiple sequence alignment,” Nucleic Acids Research, vol. 33, no. 2, pp. 511–518, 2005. View at: Publisher Site | Google Scholar
  10. A. R. Subramanian, M. Kaufmann, and B. Morgenstern, “DIALIGN-TX: greedy and progressive approaches for segment-based multiple sequence alignment,” Algorithms for Molecular Biology, vol. 3, no. 1, article 6, 2008. View at: Publisher Site | Google Scholar
  11. T. Kim and H. Joo, “ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment,” BMC Bioinformatics, vol. 11, article 467, 2010. View at: Publisher Site | Google Scholar
  12. R. C. Edgar, “MUSCLE: multiple sequence alignment with high accuracy and high throughput,” Nucleic Acids Research, vol. 32, no. 5, pp. 1792–1797, 2004. View at: Publisher Site | Google Scholar
  13. J. D. Thompson, “The clustal series of programs for multiple sequence alignment,” in The Proteomics Protocols Handbook, pp. 493–502, Humana Press, 2005. View at: Google Scholar
  14. J. Zola, X. Yang, S. Rospondek, and S. Aluru, “Parallel T-Coffee: a parallel multiple sequence aligner,” in Proceedings of the 20th ISCA International Conference on Parallel and Distributed Computing Systems (ISCA PDCS '07), pp. 248–253, 2007. View at: Google Scholar
  15. A. Wirawan, C. K. Kwoh, and B. Schmidt, “Multi-threaded vectorized distance matrix computation on the CELL/BE and x86/SSE2 architectures,” Bioinformatics, vol. 26, no. 10, pp. 1368–1369, 2010. View at: Publisher Site | Google Scholar
  16. K. Chaichoompu and S. Kittitornkun, “Multithreaded ClustalW with improved optimization for intel multi-core processor,” in Proceedings of the International Symposium on Communications and Information Technologies (ISCIT '06), pp. 590–594, October 2006. View at: Publisher Site | Google Scholar
  17. K.-B. Li, “ClustalW-MPI: ClustalW analysis using distributed and parallel computing,” Bioinformatics, vol. 19, no. 12, pp. 1585–1586, 2003. View at: Publisher Site | Google Scholar
  18. A. Wirawan, B. Schmidt, and C. K. Kwoh, “Pairwise distance matrix computation for multiple sequence alignment on the cell broadband engine,” in Computational Science—ICCS 2009, vol. 5544 of Lecture Notes in Computer Science, pp. 954–963, 2009. View at: Publisher Site | Google Scholar
  19. Y. Liu, B. Schmidt, and D. L. Maskell, “MSAProbs: multiple sequence alignment based on pair hidden Markov models and partition function posterior probabilities,” Bioinformatics, vol. 26, no. 16, pp. 1958–1964, 2010. View at: Publisher Site | Google Scholar
  20. D. Hains, Z. Cashero, M. Ottenberg, W. Bohm, and S. Rajopadhye, “Improving CUDASW, a parallelization of smith-waterman for CUDA enabled devices,” in Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum (IPDPSW '11), pp. 490–501, May 2011. View at: Publisher Site | Google Scholar
  21. Y. Liu, A. Wirawan, and B. Schmidt, “CUDASW++ 3.0: accelerating Smith-Waterman protein database search by coupling CPU and GPU SIMD instructions,” BMC Bioinformatics, vol. 14, article 117, 2013. View at: Publisher Site | Google Scholar
  22. W. Liu, B. Schmidt, G. Voss, and W. Müller-Wittig, “Streaming algorithms for biological sequence alignment on GPUs,” IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 9, pp. 1270–1281, 2007. View at: Publisher Site | Google Scholar
  23. D. Díaz, F. J. Esteban, P. Hernández et al., “Mc64-clustalwp2: a highly-parallel hybrid strategy to align multiple sequences in many-core architectures,” PLOS ONE, vol. 9, no. 4, Article ID e94044, 2014. View at: Google Scholar
  24. J. Cheetham, F. Dehne, S. Pitre, A. Rau-Chaplin, and P. J. Taillon, “Parallel CLUSTAL W for PC clusters,” in Computational Science and Its Applications—ICCSA 2003, vol. 2668 of Lecture Notes in Computer Science, pp. 300–309, 2003. View at: Publisher Site | Google Scholar
  25. National Center for Biotechnology Information (NCBI),

Copyright © 2014 Mohammed W. Al-Neama 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.

More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.