Skip to main content

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 146))

  • 519 Accesses

Abstract

In this chapter, we study the global sequence alignment problem based on an extension of dynamic programming. We provide a method to model this problem using a directed acyclic graph which allows us to describe all optimal solutions specific to a certain cost function. Furthermore, we can optimize sequence alignments successively relative to different optimization criteria.

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 EPUB and 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Chikalov, I., Hussain, S., Moshkov, M., Odat, E.: Sequential optimization of global sequence alignments relative to different cost functions. In: ACM International Conference on Convergence and Hybrid Information Technology, ICHIT 2010, Daejeon, Korea, August 26–28, 2010. ACM (2010)

    Google Scholar 

  2. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Dokl. 10, 707–710 (1966)

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  4. Setubal, J., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Publishing, Boston (1997)

    Google Scholar 

  5. Waterman, M.S.: Introduction to Computational Biology: Sequences, Maps, and Genomes. Chapman and Hall, London (1995)

    Book  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hassan AbouEisha .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M. (2019). Global Sequence Alignment. In: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol 146. Springer, Cham. https://doi.org/10.1007/978-3-319-91839-6_18

Download citation

Publish with us

Policies and ethics