Skip to main content
Top
Published in: Memetic Computing 2/2015

01-06-2015 | Regular Research Paper

A novel two-level particle swarm optimization approach for efficient multiple sequence alignment

Authors: Soniya Lalwani, Rajesh Kumar, Nilama Gupta

Published in: Memetic Computing | Issue 2/2015

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper presents two-level particle swarm optimization (TL-PSO) algorithm as an effective framework for providing the solution of complex natured problems. Proposed approach is employed to solve a challenging problem of bioinformatics i.e. multiple sequence alignment (MSA) of proteins. The major challenge in MSA is the increasing complexity of the problem as soon as the number of sequences increases and average pairwise sequence identity (APSI) score decreases. Proposed TLPSO-MSA firstly maximizes the matched columns in level one followed by maximization of pairwise similarities in level two at the gbest solutions of level one. TLPSO-MSA efficiently handles the premature convergence and trapping in local optima related issues. The benchmark dataset for MSA of protein sequences are extracted from BAliBASE3.0. The special features of proposed algorithm is its prediction accuracy at very lower APSI scores. Proposed approach significantly outperforms the compared state-of-art competitive algorithms i.e. ALIGNER, MUSCLE, T-Coffee, MAFFT, ClustalW, DIALIGN-TX, ProbAlign and standard PSO algorithm. The claim is supported by the statistical significance testing using one way ANOVA followed by Bonferroni post-hoc analysis.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Appendix
Available only for authorised users
Literature
1.
go back to reference Blum C, Li X (2008) Swarm intelligence in optimization. In: Blum C et al (eds) Swarm intelligence: introduction and applications. Springer, Berlin, Heidelberg, pp 43–85CrossRef Blum C, Li X (2008) Swarm intelligence in optimization. In: Blum C et al (eds) Swarm intelligence: introduction and applications. Springer, Berlin, Heidelberg, pp 43–85CrossRef
2.
go back to reference Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, pp 1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, pp 1942–1948
3.
go back to reference Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7:109–124CrossRefMATHMathSciNet Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7:109–124CrossRefMATHMathSciNet
4.
go back to reference Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part I: background and development. Nat Comput 6:467–484CrossRefMATHMathSciNet Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part I: background and development. Nat Comput 6:467–484CrossRefMATHMathSciNet
5.
go back to reference Poli R (2008) Analysis of the publications on the applications of particle swarm optimisation. J Artif Evol Appl, 2008 Art. ID 685175. doi:10.1155/2008/685175 Poli R (2008) Analysis of the publications on the applications of particle swarm optimisation. J Artif Evol Appl, 2008 Art. ID 685175. doi:10.​1155/​2008/​685175
6.
go back to reference Khare A, Rangnekar S (2013) A review of particle swarm optimization and its applications in solar photovoltaic system. Appl Soft Comput 13:2997–3006CrossRef Khare A, Rangnekar S (2013) A review of particle swarm optimization and its applications in solar photovoltaic system. Appl Soft Comput 13:2997–3006CrossRef
7.
go back to reference Esmin, AAA, Coelho RA, Matwin S (2013) A review on particle swarm optimization algorithm and its variants to clustering highdimensional data. Artif Intell Rev 1–23. doi:10.1007/s10462-013-9400-4 Esmin, AAA, Coelho RA, Matwin S (2013) A review on particle swarm optimization algorithm and its variants to clustering highdimensional data. Artif Intell Rev 1–23. doi:10.​1007/​s10462-013-9400-4
8.
go back to reference Sedighizadeh D, Masehian E (2009) An particle swarm optimization method, taxonomy and applications. Int J Comput Theory Eng 5:486–502CrossRef Sedighizadeh D, Masehian E (2009) An particle swarm optimization method, taxonomy and applications. Int J Comput Theory Eng 5:486–502CrossRef
9.
go back to reference Das S, Abraham A, Konar A (2008) Swarm intelligence algorithms in bioinformatics. In: Kelemen A et al (eds) Swarm intelligence algorithms in bioinformatics, vol 94. Springer, Berlin, Heidelberg, pp 113–147 Das S, Abraham A, Konar A (2008) Swarm intelligence algorithms in bioinformatics. In: Kelemen A et al (eds) Swarm intelligence algorithms in bioinformatics, vol 94. Springer, Berlin, Heidelberg, pp 113–147
10.
go back to reference Bucak IO, Uslan V (2010) An analysis of sequence alignment: heuristic algorithms. In: 32nd Annual international conference of the IEEE EMBS, Argentina, pp 1824–1827 Bucak IO, Uslan V (2010) An analysis of sequence alignment: heuristic algorithms. In: 32nd Annual international conference of the IEEE EMBS, Argentina, pp 1824–1827
11.
go back to reference Notredame C (2002) Recent progress in multiple sequence alignment: a survey. Pharmacogenomics 3(1):131–144CrossRef Notredame C (2002) Recent progress in multiple sequence alignment: a survey. Pharmacogenomics 3(1):131–144CrossRef
12.
go back to reference Carillo H, Lipman D (1988) The multiple sequence alignment problem in biology. Soc Ind Appl Math 48:1073–1082CrossRef Carillo H, Lipman D (1988) The multiple sequence alignment problem in biology. Soc Ind Appl Math 48:1073–1082CrossRef
13.
go back to reference Thompson JD, Higgins DG, Gibson TJ (1994) CLUSTALW: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specic gap penalties and weight matrix choice. Nucl Acids Res 22:4673–4680CrossRef Thompson JD, Higgins DG, Gibson TJ (1994) CLUSTALW: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specic gap penalties and weight matrix choice. Nucl Acids Res 22:4673–4680CrossRef
14.
go back to reference Mandoiu I, Zelikovsky A (2008) Bioinformatics algorithms: techniques and applications. Wiley, HobokenCrossRef Mandoiu I, Zelikovsky A (2008) Bioinformatics algorithms: techniques and applications. Wiley, HobokenCrossRef
15.
go back to reference Needleman SB, Wunsch CD (1970) A general method applicable to the search for similarity in the amino acid sequences of two proteins. J Mol Biol 48:443–453CrossRef Needleman SB, Wunsch CD (1970) A general method applicable to the search for similarity in the amino acid sequences of two proteins. J Mol Biol 48:443–453CrossRef
16.
go back to reference Stoye J, Moulton V, Dress AW (1997) DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. Comput Appl Biosci 13(6):625–626 Stoye J, Moulton V, Dress AW (1997) DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. Comput Appl Biosci 13(6):625–626
17.
go back to reference Notredame C, Higgins DG, Heringa J (2000) T-COFFEE: a novel method for fast and accurate multiple sequence alignment. J Mol Biol 302(1):205–217CrossRef Notredame C, Higgins DG, Heringa J (2000) T-COFFEE: a novel method for fast and accurate multiple sequence alignment. J Mol Biol 302(1):205–217CrossRef
18.
go back to reference Morgenstern B (1999) DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics 15(3):211–218CrossRef Morgenstern B (1999) DIALIGN 2: improvement of the segment-to-segment approach to multiple sequence alignment. Bioinformatics 15(3):211–218CrossRef
19.
go back to reference Subramanian AR, Menkhoff JW, Kaufmann M, Morgenstern B (2005) DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment. Bioinformatics 6:66 Subramanian AR, Menkhoff JW, Kaufmann M, Morgenstern B (2005) DIALIGN-T: an improved algorithm for segment-based multiple sequence alignment. Bioinformatics 6:66
20.
go back to reference Mount DW (2004) Bioinformatics sequence and genome analysis, 2nd edn. Cold Spring Harbor Laboratory Press, Cold Spring Harbor Mount DW (2004) Bioinformatics sequence and genome analysis, 2nd edn. Cold Spring Harbor Laboratory Press, Cold Spring Harbor
21.
go back to reference Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087–1092CrossRef Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087–1092CrossRef
22.
go back to reference Durbin R, Eddy S, Krogh A, Mitchison G (1998) Biological sequence analysis: probabilistic models of proteins and nucleic acids. Cambridge University Press, CambridgeCrossRefMATH Durbin R, Eddy S, Krogh A, Mitchison G (1998) Biological sequence analysis: probabilistic models of proteins and nucleic acids. Cambridge University Press, CambridgeCrossRefMATH
23.
go back to reference Kim J, Pramanik S, Chung MJ (1994) Multiple sequence alignment using simulated annealing. Comput Appl Biosci 10(4):419–426 Kim J, Pramanik S, Chung MJ (1994) Multiple sequence alignment using simulated annealing. Comput Appl Biosci 10(4):419–426
24.
go back to reference Chen Y, Pan Y, Chen J, Liu W, Chen L (2006) Multiple sequence alignment by ant colony optimization and divide-and-conquer. In: Computational science-ICCS 2006, 3992, Springer, pp 646–653 Chen Y, Pan Y, Chen J, Liu W, Chen L (2006) Multiple sequence alignment by ant colony optimization and divide-and-conquer. In: Computational science-ICCS 2006, 3992, Springer, pp 646–653
25.
go back to reference Bucak IO, Uslan V (2011) Sequence alignment from the perspective of stochastic optimization: a survey. Turk J Electr Eng 19(1):157–173 Bucak IO, Uslan V (2011) Sequence alignment from the perspective of stochastic optimization: a survey. Turk J Electr Eng 19(1):157–173
26.
go back to reference Heringa J (1999) Two strategies for sequence comparison: profile-preprocessed and secondary structure-induced multiple alignment. Comput Chem 23:341–364CrossRef Heringa J (1999) Two strategies for sequence comparison: profile-preprocessed and secondary structure-induced multiple alignment. Comput Chem 23:341–364CrossRef
27.
go back to reference Brocchieri L, Karlin S (1998) Asymetric-iterated multiple alignment of protein sequences. J Mol Biol 276:249–264CrossRef Brocchieri L, Karlin S (1998) Asymetric-iterated multiple alignment of protein sequences. J Mol Biol 276:249–264CrossRef
28.
go back to reference Lalwani S, Kumar R, Gupta N (2013) A review on particle swarm optimization variants and their applications to multiple sequence alignment. J Appl Math Bioinform 3(2):87–124 Lalwani S, Kumar R, Gupta N (2013) A review on particle swarm optimization variants and their applications to multiple sequence alignment. J Appl Math Bioinform 3(2):87–124
29.
go back to reference Glover FW, Kochenberger GA (2003) Handbook of metaheuristics. International series in operations research and management science. Kluwer Academic Publishers, BostonCrossRef Glover FW, Kochenberger GA (2003) Handbook of metaheuristics. International series in operations research and management science. Kluwer Academic Publishers, BostonCrossRef
30.
go back to reference Trianni V, Nolfi S, Dorigo M (2008) Evolution, self-organization and swarm robotics. In: Blum C et al (eds) Swarm intelligence: introduction and applications. Springer, Berlin, Heidelberg, pp 163–191CrossRef Trianni V, Nolfi S, Dorigo M (2008) Evolution, self-organization and swarm robotics. In: Blum C et al (eds) Swarm intelligence: introduction and applications. Springer, Berlin, Heidelberg, pp 163–191CrossRef
31.
go back to reference Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA
32.
go back to reference Parsopoulos KE, Vrahatis MN (2010) Particle swarm optimization and intelligence: advances and applications, information science reference. Hershey, New YorkCrossRef Parsopoulos KE, Vrahatis MN (2010) Particle swarm optimization and intelligence: advances and applications, information science reference. Hershey, New YorkCrossRef
33.
go back to reference Sun J, Lai CH, Wu XJ (2012) Particle swarm optimisation: classical and quantum perspectives. CRC Press, Boca Raton Sun J, Lai CH, Wu XJ (2012) Particle swarm optimisation: classical and quantum perspectives. CRC Press, Boca Raton
34.
go back to reference Lalwani S, Kumar R, Gupta N (2013) A study on inertia weight schemes with modified particle swarm optimization algorithm for multiple sequence alignment. In: 6th IEEE international conference on contemporary computing, Noida, India, pp 283–288 Lalwani S, Kumar R, Gupta N (2013) A study on inertia weight schemes with modified particle swarm optimization algorithm for multiple sequence alignment. In: 6th IEEE international conference on contemporary computing, Noida, India, pp 283–288
35.
go back to reference Zablocki FBR (2007) Multiple sequence alignment using Particle swarm optimization. MS dissertation, University of Pretoria Zablocki FBR (2007) Multiple sequence alignment using Particle swarm optimization. MS dissertation, University of Pretoria
36.
go back to reference Toscano-Pulido G, Reyes-Medina AJ, Ramrez-Torres JG (2011) A statistical study of the effects of neighborhood topologies in particle swarm optimization, Computational Intelligence, SCI 343. Springer, Berlin, Heidelberg Toscano-Pulido G, Reyes-Medina AJ, Ramrez-Torres JG (2011) A statistical study of the effects of neighborhood topologies in particle swarm optimization, Computational Intelligence, SCI 343. Springer, Berlin, Heidelberg
37.
go back to reference Kennedy J, Mendes R (2002) Population structure and particle performance. In: Proceedings of the IEEE congress on evolutionary computation, Washington, DC, pp 1671–1676 Kennedy J, Mendes R (2002) Population structure and particle performance. In: Proceedings of the IEEE congress on evolutionary computation, Washington, DC, pp 1671–1676
38.
go back to reference Setubal JC, Meidanis J (1997) Introduction to computational biology. Brooks/Cole, Pacific Grove Setubal JC, Meidanis J (1997) Introduction to computational biology. Brooks/Cole, Pacific Grove
39.
go back to reference Chellapilla K, Fogel GB (1999) Multiple sequence alignment using evolutionary programming. In: Proceedings of the 1999 congress on evolutionary computation, Washington, DC, pp 445–452 Chellapilla K, Fogel GB (1999) Multiple sequence alignment using evolutionary programming. In: Proceedings of the 1999 congress on evolutionary computation, Washington, DC, pp 445–452
40.
go back to reference Thompson JD, Koehl P, Ripp R, Poch O (2005) BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 61(1):127–136CrossRef Thompson JD, Koehl P, Ripp R, Poch O (2005) BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 61(1):127–136CrossRef
41.
go back to reference Henikoff S, Henikoff JG (1992) Amino acid substitution matrices from protein blocks. PNAS 89(92):10915–10919CrossRef Henikoff S, Henikoff JG (1992) Amino acid substitution matrices from protein blocks. PNAS 89(92):10915–10919CrossRef
42.
go back to reference Thompson JD, Plewniak F, Poch O (1999) A comprehensive comparison of multiple sequence alignment programs. Nucl Acids Res 27(13):2682–2690CrossRef Thompson JD, Plewniak F, Poch O (1999) A comprehensive comparison of multiple sequence alignment programs. Nucl Acids Res 27(13):2682–2690CrossRef
43.
go back to reference Kelil A, Wang S, Brzezinski R, Fleury A (2007) CLUSS: clustering of protein sequences based on a new similarity measure. BMC Bioinform 8:286CrossRef Kelil A, Wang S, Brzezinski R, Fleury A (2007) CLUSS: clustering of protein sequences based on a new similarity measure. BMC Bioinform 8:286CrossRef
44.
go back to reference Edgar RC (2004) MUSCLE. A multiple sequence alignment method with reduced time and space complexity. BMC Bioinform 5:113CrossRef Edgar RC (2004) MUSCLE. A multiple sequence alignment method with reduced time and space complexity. BMC Bioinform 5:113CrossRef
45.
go back to reference Katoh K, Misawa K, Kuma K, Miyata T (2002) MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucl Acids Res 30:3059–3066CrossRef Katoh K, Misawa K, Kuma K, Miyata T (2002) MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucl Acids Res 30:3059–3066CrossRef
46.
go back to reference Larkin MA, Blackshields G, Brown NP, Chenna R, McGettigan PA, McWilliam H, Valentin F, Wallace IM, Wilm A, Lopez R, Thompson JD, Gibson TJ, Higgins DG (2007) ClustalW and ClustalX version 2. Bioinformatics 23(21):2947–2948CrossRef Larkin MA, Blackshields G, Brown NP, Chenna R, McGettigan PA, McWilliam H, Valentin F, Wallace IM, Wilm A, Lopez R, Thompson JD, Gibson TJ, Higgins DG (2007) ClustalW and ClustalX version 2. Bioinformatics 23(21):2947–2948CrossRef
47.
go back to reference Subramanian AR, Kaufmann M, Morgenstern B (2008) DIALIGN-TX: Greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms Mol Biol 3(6) Subramanian AR, Kaufmann M, Morgenstern B (2008) DIALIGN-TX: Greedy and progressive approaches for segment-based multiple sequence alignment. Algorithms Mol Biol 3(6)
48.
go back to reference Roshan U, Libesay DR (2006) Probalign: multiple sequence alignment using partition function posterior probabilities. Bioinformatics 22(22):2715–2721 Roshan U, Libesay DR (2006) Probalign: multiple sequence alignment using partition function posterior probabilities. Bioinformatics 22(22):2715–2721
Metadata
Title
A novel two-level particle swarm optimization approach for efficient multiple sequence alignment
Authors
Soniya Lalwani
Rajesh Kumar
Nilama Gupta
Publication date
01-06-2015
Publisher
Springer Berlin Heidelberg
Published in
Memetic Computing / Issue 2/2015
Print ISSN: 1865-9284
Electronic ISSN: 1865-9292
DOI
https://doi.org/10.1007/s12293-015-0157-y

Other articles of this Issue 2/2015

Memetic Computing 2/2015 Go to the issue

Editorial

Editorial

Premium Partner