Parallelization of Multiple Genome Alignment

  • Yiming Li
  • Cheng-Kai Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3726)


In this work, we implement a genome alignment system which applies parallelization schemes to the ClustalW algorithm and the interface of database querying. Parallel construction of the distance matrices and parallelization of progressive alignment in the ClustalW algorithm are performed on PC-based Linux cluster with message-passing interface libraries. Achieved experiments show good speedup and significant parallel performance.


Multiple Sequence Alignment Parallel Performance Pairwise Alignment Guide Tree Genome Alignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Vingron, M., Argos, P.: A fast and sensitive multiple sequence alignment algorithm. Comput. Appl. Biosci. 5, 115–121 (1989)Google Scholar
  2. 2.
    Gupta, S.K., Kececioglu, J.D., Schäffer, A.A.: Improving the Practical Time and Space Efficiency of the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment. J. Comput. Bio. 2, 459–472 (1995)CrossRefGoogle Scholar
  3. 3.
    Zhang, C., Wong, A.K.C.: Toward efficient multiple molecular sequence alignment: a system of genetic algorithm and dynamic programming. IEEE Trans. Systems, Man and Cybernetics, Part B. 27, 918–932 (1997)CrossRefGoogle Scholar
  4. 4.
    Luo, J., Ahmad, I., Ahmed, M., Paul, R.: Parallel Multiple Sequence Alignment with Dynamic Scheduling. In: IEEE Int. Conf. Info. Tech.: Coding and Computing, vol. 1, pp. 8–13 (2005)Google Scholar
  5. 5.
    Higgins, D.G., Sharp, P.M.: CLUSTAL: a Package for Performing Multiple Sequence Alignment in a Microcomputer. Gene. 73, 237–244 (1988)CrossRefGoogle Scholar
  6. 6.
    Kleinjung, J., Douglas, N., Herringa, J.: Parallelized multiple alignment. Bioinformatics 18, 1270–1271 (2002)CrossRefGoogle Scholar
  7. 7.
    Li, K.-B.: ClustalW-MPI: ClustalW analysis using distributed and parallel computing. Bioinformatics 19, 1585–1586 (2003)CrossRefGoogle Scholar
  8. 8.
    Li, Y., Sze, S.M., Chao, T.-S.: A Practical Implementation of Parallel Dynamic Load Balancing for Adaptive Computing in VLSI Device Simulation. Engineering with Computers 18, 124–137 (2002)CrossRefGoogle Scholar
  9. 9.
    Feng, D.F., Doolittle, R.F.: Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol. 25, 351–360 (1987)CrossRefGoogle Scholar
  10. 10.
    Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. J. Mol. Evol. 4, 406–425 (1987)Google Scholar
  11. 11.
    National Center for Biotechnology Information. [Online]. Available:

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yiming Li
    • 1
    • 2
  • Cheng-Kai Chen
    • 2
    • 3
  1. 1.Department of Communication Engineering 
  2. 2.Microelectronics and Information Systems Research Center 
  3. 3.Department of Computer and Information ScienceNational Chiao Tung UniversityHsinchu City, HsinchuTaiwan

Personalised recommendations