Skip to main content
SpringerLink
Log in

Genetic Algorithm Using Guide Tree in Mutation Operator for Solving Multiple Sequence Alignment

  • Chapter
  • First Online:
Advanced Computing and Systems for Security

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 395))

Abstract

An improved mutation operator in genetic algorithm for solving multiple sequence alignment problems is proposed. In this step, the UPGMA method is used to generate the guide tree where two different matrices such as edit distance or dynamic distance have been used. The performance of the proposed method has been tested on Bali base with some of the existing methods such as, HMMT, DIALIGN, ML–PIMA, and PILEUP8. It has been observed that the proposed method perform better in most of the cases.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York, Computer Science and Computational Biology (1997)

    Book  MATH  Google Scholar 

  2. Feng, D.F., Johnson, M.S., Doolittle, R.F.: Aligning amino acid sequences: comparison of commonly used methods. J. Mol. Evol. 21(2), 112–125 (1985)

    Article  Google Scholar 

  3. Holland, J.H.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  4. Michalewicz, Z., Genetic algorithms + data structures = evolution programs—Third, Revised and Extended Edition, 3 edn. Springer, Berlin (1996)

    Google Scholar 

  5. Thompson, J.D., Plewniak, F., Poch, O.: A comprehensive comparison of multiple sequence alignment programs. Nucleic Acids Res. 27(13), 2682–2690 (1999)

    Article  Google Scholar 

  6. Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48(3), 443–453 (1970)

    Article  Google Scholar 

  7. Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195–197 (1981)

    Article  Google Scholar 

  8. Stoye, J., Perrey, S.W., Dress, A.W.M.: Improving the divide-and conquer approach to sum-of-pairs multiple sequence alignment. Appl. Math. Lett. 10(2), 67–73 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bonizzoni, P., Vedova, G.D.: The complexity of multiple sequence alignment with SP-score that is a metric. Theor. Comp. Sci. 259, 63–79 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Feng, D.F., Dolittle, R.F.: Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J. Mol. Evol. 25(4), 351–360 (1987)

    Article  Google Scholar 

  11. Thompson, J.D., Higgins, D.G., Gibson, T.J.: CLUSTALW: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 22(22), 4673–4680 (1994)

    Article  Google Scholar 

  12. Gotoh, O.: Optimal alignment between groups of sequences and its application to multiple sequence alignment. Comput. Appl. Biosci. 9(3), 361–370 (1993)

    Google Scholar 

  13. Lukashin, A.V., Engelbrecht, J., Brunak, S.: Multiple alignment using simulated annealing: branch point definition in human mRNA splicing. Nucleic Acids Res. 20(10), 2511–2516 (1992)

    Article  Google Scholar 

  14. Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F., Wooton, J.C.: Detecting subtle sequence signals: q Gibbs sampling strategy for multiple alignment. Science 262, 208–214 (1993)

    Article  Google Scholar 

  15. Dayhoff, M.O., Schwartz, R.M., Orcutt, B.C., A model of evolutionary change in proteins, Atlas Protein Sequence Structure, vol. 5, no. 3, pp. 345–351 (1978)

    Google Scholar 

  16. Shyu, C., Sheneman, L., Foster, J.A.: Multiple sequence alignment with evolutionary computation. Genet. Program. Evol. Mech. 5, 121–144 (2004)

    Article  Google Scholar 

  17. Sneath, P.H.A., Sokal, R.R.: Taxonomic structure. In: Taxonomy, Numerical (ed.) San Francisco, pp. 188–308. Freeman, CA (1973)

    Google Scholar 

  18. Thompson, J.D., Plewniak, F., Poch, O., Bali, B.A.S.E.: A benchmark alignments database for the evaluation of multiple sequence alignment programs. Bioinformatics 15(1), 87–88 (1999)

    Article  Google Scholar 

  19. Bahr, A., Thompson, J.D., Thierry, J.C., Poch, O.: BALIBASE (benchmark alignment database): enhancements for repeats, trans membrane sequences and circular permutation. Nucleic Acids Res. 29(1), 323–326 (2000)

    Article  Google Scholar 

  20. Taheri, J., and Zomaya, A.Y., RBT-GA: A novel metaheuristic for solving the multiple sequence alignment problem. BMC Genomics 10(1) 1–11 (2009)

    Google Scholar 

Download references

Acknowledgments

The work was partially supported by CSIR grant no. 22(0586)/12/EMR-11.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian School of Mines, Dhanbad, 826004, India

    Rohit Kumar Yadav & Haider Banka

Authors
  1. Rohit Kumar Yadav
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haider Banka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rohit Kumar Yadav .

Editor information

Editors and Affiliations

  1. A.K. Choudhury School of Information Technology, University of Calcutta, Kolkata, West Bengal, India

    Rituparna Chaki

  2. UniversitĂ  Ca' Foscari, Venice, Italy

    Agostino Cortesi

  3. Bialystok University of Technology Faculty of Computer Science, Bialystok, Poland

    Khalid Saeed

  4. University of Calcutta, Kolkata, West Bengal, India

    Nabendu Chaki

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this chapter

Cite this chapter

Yadav, R.K., Banka, H. (2016). Genetic Algorithm Using Guide Tree in Mutation Operator for Solving Multiple Sequence Alignment. In: Chaki, R., Cortesi, A., Saeed, K., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 395. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2650-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2650-5_10

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2648-2

  • Online ISBN: 978-81-322-2650-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation