Skip to main content

2018 | OriginalPaper | Buchkapitel

An Efficient Cooperative Method to Solve Multiple Sequence Alignment Problem

verfasst von : Lamiche Chaabane

Erschienen in: Computational Intelligence and Its Applications

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this research work, we propose a cooperative approach called simulated particle swarm optimization (SPSO) which is based on metaheuristics to find an approximate solution for the multiple sequence alignment (MSA) problem. The developed approach uses the particle swam optimization (PSO) algorithm to discover the search space globally and the simulated annealing (SA) technique to improve the population leader «gbest» quality in order to overcome local optimum problem. Simulation results on BaliBASE benchmarks have shown the potent of the proposed method to produce good quality alignments comparing to those given by other existing methods.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Literatur
1.
Zurück zum Zitat Thompson, J.D., Thierry, J.C., Poch, O.: RASCAL: rapid scanning and correction of multiple sequence alignments. Bioinformatics 19(9), 1155–1161 (2003)CrossRef Thompson, J.D., Thierry, J.C., Poch, O.: RASCAL: rapid scanning and correction of multiple sequence alignments. Bioinformatics 19(9), 1155–1161 (2003)CrossRef
2.
Zurück zum Zitat Jiang, T., Wang, L.: On the complexity of multiple sequence alignment. J. Comput. Biol. 1, 337–378 (1994)CrossRef Jiang, T., Wang, L.: On the complexity of multiple sequence alignment. J. Comput. Biol. 1, 337–378 (1994)CrossRef
3.
Zurück zum Zitat Bonizzoni, P., Della Vedova, G.: The complexity of multiple sequence alignment with SP-score that is a metric. Theor. Comput. Sci. 259, 63–79 (2001)MathSciNetCrossRef Bonizzoni, P., Della Vedova, G.: The complexity of multiple sequence alignment with SP-score that is a metric. Theor. Comput. Sci. 259, 63–79 (2001)MathSciNetCrossRef
4.
Zurück zum Zitat Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York (1998)MATH Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, New York (1998)MATH
5.
Zurück zum Zitat Horng, J.T., Wu, L.C., Lin, C.M., Yang, B.H.: A Genetic algorithm for multiple sequence alignment. Soft Comput. 9, 407–420 (2005)CrossRef Horng, J.T., Wu, L.C., Lin, C.M., Yang, B.H.: A Genetic algorithm for multiple sequence alignment. Soft Comput. 9, 407–420 (2005)CrossRef
6.
Zurück zum Zitat Hernández-Guía, M., Mulet, R., Rodríguez-Pérez, S.: A new simulated annealing algorithm for the multiple sequence alignment problem. The approach of polymers in a random media. Phys. Rev. E 72, 1–7 (2005)CrossRef Hernández-Guía, M., Mulet, R., Rodríguez-Pérez, S.: A new simulated annealing algorithm for the multiple sequence alignment problem. The approach of polymers in a random media. Phys. Rev. E 72, 1–7 (2005)CrossRef
7.
Zurück zum Zitat Lei, C.W., Ruan, J.H.: A particle swarm optimization algorithm for finding DNA sequence motifs. In: Proceedings IEEE, pp. 166–173 (2008) Lei, C.W., Ruan, J.H.: A particle swarm optimization algorithm for finding DNA sequence motifs. In: Proceedings IEEE, pp. 166–173 (2008)
8.
Zurück zum Zitat Lee, Z.J., Su, S.F., Chuang, C.C., Liu, K.H.: Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl. Soft Comput. 8, 55–78 (2008)CrossRef Lee, Z.J., Su, S.F., Chuang, C.C., Liu, K.H.: Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment. Appl. Soft Comput. 8, 55–78 (2008)CrossRef
9.
Zurück zum Zitat Chen, L., Zou, L., Chen, J.: An efficient ant colony algorithm for multiple sequences alignment. In: Proceedings of the 3rd International Conference on Natural Computation (ICNC 2007), pp. 208–212 (2007) Chen, L., Zou, L., Chen, J.: An efficient ant colony algorithm for multiple sequences alignment. In: Proceedings of the 3rd International Conference on Natural Computation (ICNC 2007), pp. 208–212 (2007)
10.
Zurück zum Zitat Riaz, T., Wang, Y., Li, K.B.: Multiple sequence alignment using tabu search. In: Proceedings of 2nd Asia-Pacific Bioinformatics Conference (APBC), Dunedin, New Zealand, pp. 223–232 (2004) Riaz, T., Wang, Y., Li, K.B.: Multiple sequence alignment using tabu search. In: Proceedings of 2nd Asia-Pacific Bioinformatics Conference (APBC), Dunedin, New Zealand, pp. 223–232 (2004)
12.
Zurück zum Zitat Chen, Y., Hu, J., Hirasawa, K., Yu, S.: Multiple sequence alignment based on genetic algorithm with reserve selection. In: Proceedings of International Conference on Networking, Sensing and Control (ICNSC), pp. 1511–1516 (2008) Chen, Y., Hu, J., Hirasawa, K., Yu, S.: Multiple sequence alignment based on genetic algorithm with reserve selection. In: Proceedings of International Conference on Networking, Sensing and Control (ICNSC), pp. 1511–1516 (2008)
13.
Zurück zum Zitat Long, H.X., Xu, W.B., Sun, J., Ji, W.J.: Multiple sequence alignment based on a binary particle swarm optimization algorithm. In: Proceedings of Fifth International Conference on Natural Computation, pp. 265–269 (2009) Long, H.X., Xu, W.B., Sun, J., Ji, W.J.: Multiple sequence alignment based on a binary particle swarm optimization algorithm. In: Proceedings of Fifth International Conference on Natural Computation, pp. 265–269 (2009)
14.
Zurück zum Zitat Lei, X., Sun, J., Xu, X., Guo, L.: Artificial bee colony algorithm for solving multiple sequence alignment. In: Proceedings of 2010 IEEE Fifth International Conference on BIC-TA, pp. 337–342 (2010) Lei, X., Sun, J., Xu, X., Guo, L.: Artificial bee colony algorithm for solving multiple sequence alignment. In: Proceedings of 2010 IEEE Fifth International Conference on BIC-TA, pp. 337–342 (2010)
15.
Zurück zum Zitat Cutello, V., Nicosia, G., Pavone, M., Prizzi, I.: Protein multiple sequence alignment by hybrid bio-inspired algorithms. Nucleic Acids Res. 39(6), 1980–1992 (2011)CrossRef Cutello, V., Nicosia, G., Pavone, M., Prizzi, I.: Protein multiple sequence alignment by hybrid bio-inspired algorithms. Nucleic Acids Res. 39(6), 1980–1992 (2011)CrossRef
16.
Zurück zum Zitat Liñán-García, E., Gallegos-Araiza, L.M.: Simulated annealing with previous solutions applied to DNA sequence alignment. ISRN Artif. Intell. 2012, 1–6 (2012)CrossRef Liñán-García, E., Gallegos-Araiza, L.M.: Simulated annealing with previous solutions applied to DNA sequence alignment. ISRN Artif. Intell. 2012, 1–6 (2012)CrossRef
17.
Zurück zum Zitat Abu-Srhan, A., Al Daoud, E.: A hybrid algorithm using a genetic algorithm and cuckoo search algorithm to solve the traveling salesman problem and its application to multiple sequence alignment. Int. J. Adv. Sci. Technol. 61, 29–38 (2013)CrossRef Abu-Srhan, A., Al Daoud, E.: A hybrid algorithm using a genetic algorithm and cuckoo search algorithm to solve the traveling salesman problem and its application to multiple sequence alignment. Int. J. Adv. Sci. Technol. 61, 29–38 (2013)CrossRef
18.
Zurück zum Zitat Kayaa, M., Sarhanb, A., Alhajjb, R.: Multiple sequence alignment with affine gap by using multi-objective genetic algorithm. Comput. Meth. Programs Biomed. 114, 38–49 (2014)CrossRef Kayaa, M., Sarhanb, A., Alhajjb, R.: Multiple sequence alignment with affine gap by using multi-objective genetic algorithm. Comput. Meth. Programs Biomed. 114, 38–49 (2014)CrossRef
19.
Zurück zum Zitat Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, vol. 4, pp. 1942–1948, (1995) Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Perth, vol. 4, pp. 1942–1948, (1995)
20.
Zurück zum Zitat Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)MathSciNetCrossRef Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)MathSciNetCrossRef
21.
Zurück zum Zitat Rodriguez, P.F., Nino, L.F., Alonso, O.M.: Multiple sequence alignment using swarm intelligence. Int. J. Comput. Intell. Res. 3(2), 123–130 (2007) Rodriguez, P.F., Nino, L.F., Alonso, O.M.: Multiple sequence alignment using swarm intelligence. Int. J. Comput. Intell. Res. 3(2), 123–130 (2007)
22.
Zurück zum Zitat Lamiche, C.: An effective alignment technique to solve MSA problem. Asian J. Math. Comput. 17(2), 2395–4213 (2017) Lamiche, C.: An effective alignment technique to solve MSA problem. Asian J. Math. Comput. 17(2), 2395–4213 (2017)
23.
Zurück zum Zitat Thompson, J.D., Plewniak, F., Poch, O.: BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15, 87–88 (1999)CrossRef Thompson, J.D., Plewniak, F., Poch, O.: BAliBASE: a benchmark alignment database for the evaluation of multiple alignment programs. Bioinformatics 15, 87–88 (1999)CrossRef
24.
Zurück zum Zitat Lalwani, S., Kumar, R., Gupta, N.: A novel two-level particle swarm optimization approach for efficient multiple sequence alignment. Memet. Comput. 7(2), 119–133 (2015)CrossRef Lalwani, S., Kumar, R., Gupta, N.: A novel two-level particle swarm optimization approach for efficient multiple sequence alignment. Memet. Comput. 7(2), 119–133 (2015)CrossRef
25.
Zurück zum Zitat Thompson, J.D., Koehl, P., Ripp, R., Poch, O.: BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 61(1), 127–136 (2005)CrossRef Thompson, J.D., Koehl, P., Ripp, R., Poch, O.: BAliBASE 3.0: latest developments of the multiple sequence alignment benchmark. Proteins 61(1), 127–136 (2005)CrossRef
26.
Zurück zum Zitat Thompson, J.D., Plewniak, F., Poch, O.: A comprehensive comparison of multiple sequence alignment programs. Nucleic Acids Res. 27(13), 2682–2690 (1999)CrossRef Thompson, J.D., Plewniak, F., Poch, O.: A comprehensive comparison of multiple sequence alignment programs. Nucleic Acids Res. 27(13), 2682–2690 (1999)CrossRef
Metadaten
Titel
An Efficient Cooperative Method to Solve Multiple Sequence Alignment Problem
verfasst von
Lamiche Chaabane
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-89743-1_17