Skip to main content

A Quantum Evolutionary Algorithm for Effective Multiple Sequence Alignment

  • Conference paper
Progress in Artificial Intelligence (EPIA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3808))

Included in the following conference series:

Abstract

This paper describes a novel approach to deal with multiple sequence alignment (MSA). MSA is an essential task in bioinformatics which is at the heart of denser and more complex tasks in biological sequence analysis. MSA problem still attracts researcher’s attention despite the significant research effort spent to solve it. We propose in this paper a quantum evolutionary algorithm to improve solutions given by CLUSTALX package. The contribution consists in defining an appropriate representation scheme that allows applying successfully on MSA problem some quantum computing principles like qubit representation and superposition of states. This representation scheme is embedded within an evolutionary algorithm leading to an efficient hybrid framework which achieves better balance between exploration and exploitation capabilities of the search process. Experiments on a wide range of data sets have shown the effectiveness of the proposed framework and its ability to improve by many orders of magnitude the CLUSTALX’s solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Attwood, T.K., Smith, D.J.: Introduction to Bioinformatics. Addison-Wesley Longman, Amsterdam (1999)

    Google Scholar 

  2. Notredame, C.: Recent progresses in MSA: a survey. Pharmacogenomic 3, 1–14 (2002)

    Article  Google Scholar 

  3. Thomsen, R., Fogel, G.B., Krink, T.A.: Clustal Alignment Improver using Evolutionary Algorithms. In: Proceedings of the Fourth Congress on Evolutionary Computation (CEC 2002), vol. 1, pp. 121–126 (2002)

    Google Scholar 

  4. Notredame, C., Holm, L., Higgins, D.G.: COFFEE: An objective function for multiple sequence alignments. Bioinformatics 14(5), 407–422 (1998)

    Article  Google Scholar 

  5. Needlman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino-acid sequence of two proteins. Journal of Molecular Biology 48, 443–453 (1970)

    Article  Google Scholar 

  6. Kim, J., Pramanik, S., Chung, M.J.: Multiple sequence alignment using simulated annealing. Computer applications in bioscience 10, 419–426 (1994)

    Google Scholar 

  7. Notredame, C., Higgins, D.G.: SAGA: sequence alignment by genetic algorithm. Nucleic Acids Research 24(8), 1515–1524 (1996)

    Article  Google Scholar 

  8. Riaz, T., Wang, Y., Li, K.B.: Multiple sequence alignment using Tabu Search. In: Proc. 2nd Asia-Pacific Bioinformatics Conference (APBC), vol. 2004, pp. 223–232 (2004)

    Google Scholar 

  9. Chellapilla, K., Fogel, G.B.: Multiple sequence alignment using evolutionary programming. In: Proc. 1999 Congr. Evolutionary Computation, pp. 445–452 (1999)

    Google Scholar 

  10. Anbarasu, L.A., Narayanasamy, P., Sundararajan, V.: Multiple molecular sequence alignment by island parallel genetic algorithm. Current Science 78, 858–863 (2000)

    Google Scholar 

  11. Narayanan, A., Moore, M.: Quantum-inspired genetic algorithms. In: Proc. IEEE Int. Conf. Evolutionary Computation, vol. 1996, pp. 61–66 (1996)

    Google Scholar 

  12. Han, K.H., Kim, J.H.: Quantum-Inspired Evolutionary Algorithms with a New Termination Criterion, H ε Gate, and Two-Phase Scheme. IEEE Transactions on Evolutionary Computation 8, 156–169 (2004)

    Article  Google Scholar 

  13. Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Proc. 35th Annu. Symp. Foundations Computer Science, Sante Fe, NM, pp. 124–134 (1994)

    Google Scholar 

  14. Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proc. 28th ACM Symp. Theory Computing, pp. 212–219 (1996)

    Google Scholar 

  15. Williams, C.P., Clearwater, S.H.: Explorations in quantum computing. Springer, Berlin (1998)

    Google Scholar 

  16. Han, K.H., Kim, J.H.: Genetic quantum algorithm and its application to combinatorial optimization problem. In: Proc. 2000 Congr. Evolutionary Computation, La Jolla, CA, vol. 2, pp. 1354–1360 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meshoul, S., Layeb, A., Batouche, M. (2005). A Quantum Evolutionary Algorithm for Effective Multiple Sequence Alignment. In: Bento, C., Cardoso, A., Dias, G. (eds) Progress in Artificial Intelligence. EPIA 2005. Lecture Notes in Computer Science(), vol 3808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595014_26

Download citation

  • DOI: https://doi.org/10.1007/11595014_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30737-2

  • Online ISBN: 978-3-540-31646-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics