Aligning multiple protein sequences by hybrid clonal selection algorithm with insert-remove-gaps and blockshuffling operators

  • Authors:

  • V. Cutello;D. Lee;G. Nicosia;M. Pavone;I. Prizzi

  • Affiliations:

  • Department of Mathematics and Computer Science, University of Catania, Catania, Italy;IBM-KAIST Bio-Computing Research Center, Department of BioSystems, KAIST, Daejeon, Republic of Korea;Department of Mathematics and Computer Science, University of Catania, Catania, Italy;IBM-KAIST Bio-Computing Research Center, Department of BioSystems, KAIST, Daejeon, Republic of Korea;Diogenes Research Center, Catania, Italy

  • Venue:
  • ICARIS'06 Proceedings of the 5th international conference on Artificial Immune Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiple sequence alignment (MSA) is one of the most important tasks in biological sequence analysis. This paper will primarily focus on on protein alignments, but most of the discussion and methodology also applies to DNA alignments. A novel hybrid clonal selection algorihm, called an aligner, is presented. It searches for a set of alignments amongst the population of candidate alignments by optimizing the classical weighted sum of pairs objective function. Benchmarks from BaliBASE library (v.1.0 and v.2.0) are used to validate the algorithm. Experimental results of BaliBASE v.1.0 benchmarks show that the proposed algorithm is superior to PRRP, ClustalX, SAGA, DIALIGN, PIMA, MULTIALIGN, and PILEUP8. On BaliBASE v.2.0 benchmarks the algorithm shows interesting results in terms of SP score with respect to established and leading methods, i.e. ClustalW, T-Coffee, MUSCLE, PRALINE, ProbCons, and Spem.