Skip to main content
SpringerLink
Log in

Dynamic Programming

  • Protocol
  • First Online:
Multiple Sequence Alignment Methods

Part of the book series: Methods in Molecular Biology ((MIMB,volume 1079))

Abstract

Independent scoring of the aligned sections to determine the quality of biological sequence alignments enables recursive definitions of the overall alignment score. This property is not only biologically meaningful but it also provides the opportunity to find the optimal alignments using dynamic programming-based algorithms. Dynamic programming is an efficient problem solving technique for a class of problems that can be solved by dividing into overlapping subproblems. Pairwise sequence alignment techniques such as Needleman–Wunsch and Smith–Waterman algorithms are applications of dynamic programming on pairwise sequence alignment problems. These algorithms offer polynomial time and space solutions. In this chapter, we introduce the basic dynamic programming solutions for global, semi-global, and local alignment problems. Algorithmic improvements offering quadratic-time and linear-space programs and approximate solutions with space-reduction and seeding heuristics are discussed. We finally introduce the application of these techniques on multiple sequence alignment briefly.

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

Access this chapter

Log in via an institution
Protocol
USD 49.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 119.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. Waterman MS (1995) Introduction to computational biology. Chapman & Hall, London

    Google Scholar 

  2. Bellman R (1958) On a routing problem. Q Appl Math 16:87–90

    Google Scholar 

  3. Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J Assoc Comput Mach 3:596–615

    Article  Google Scholar 

  4. Needleman SB, Wunsch CD (1970) A general method applicable to the search for similarities in the amino acid sequences of two proteins. J Mol Biol 48:443–453

    Article  PubMed  CAS  Google Scholar 

  5. Waterman MS, Smith TF, Beyer WA (1976) Some biological sequence metrics. Adv Math 20:367–387

    Article  Google Scholar 

  6. Waterman MS, Smith TF (1981) Identification of common molecular subsequences. J Mol Biol 147:195–197

    Article  PubMed  Google Scholar 

  7. Waterman MS (1981) Sequence alignments in the neighborhood of the optimum with general application to dynamic programming. Proc Natl Acad Sci USA 80:3123–3124

    Article  Google Scholar 

  8. Gotoh O (1982) An improved algorithm for matching biological sequences. J Mol Biol 162:705–708

    Article  PubMed  CAS  Google Scholar 

  9. Hirschberg DS (1975) Linear space algorithm for computing longest common subsequences. Commun Assoc Comput Mach 18:341–343

    Google Scholar 

  10. Myers E, Miller W (1988) Optimal alignments in linear space. CABIOS 4:11–17

    PubMed  CAS  Google Scholar 

  11. Chao KM, Pearson WR, Miller W (1992) Aligning two sequences within a specified diagonal band. Comput Appl Biosci 8(5):481–487

    PubMed  CAS  Google Scholar 

  12. Chao KM, Hardison RC, Miller W (1993) Constrained sequence alignment. Comput Appl Biosci 55(3):503–524

    CAS  Google Scholar 

  13. Hirschberg DS (1997) Serial computations of Lcvenshtein distances. In: Pattern matching algorithms. Oxford University Press, New York, pp 123–141

    Google Scholar 

  14. Huang X, Hardison RC, Miller W (1990) A space-efficient algorithm for local similarities. Comput Appl Biosci 6(4):373–381

    PubMed  CAS  Google Scholar 

  15. Huang XQ, Miller W (1991) A time-efficient, linear-space local similarity algorithm. Adv Appl Math 12(3):337–357

    Article  Google Scholar 

  16. Chao KM, Hardison RC, Miller W (1994) Recent developments in linear-space alignment methods: a survey. J Comput Biol 1:271–291

    Article  PubMed  CAS  Google Scholar 

  17. Spouge JL (1989) Speeding up dynamic programming algorithms for finding optimal lattice paths. SIAM J Appl Math 49(5):1552–1566

    Article  Google Scholar 

  18. Korf RE (1985) Depth-first iterative-deepening: an optimal admissible tree search. Artif Intell 27(1):97–109

    Article  Google Scholar 

  19. Ukkonen E (1985) Algorithms for approximate string matching. Inf Control 64:100–118

    Article  Google Scholar 

  20. Lipman DJ, Pearson WR (1985) Rapid and sensitive protein similarity searches. Science 227(4693):1435–1441

    Article  PubMed  CAS  Google Scholar 

  21. Pearson WR, Lipman DJ (1988) Improved tools for biological sequence comparison. Proc Natl Acad Sci USA 85(8):2444–2448

    Article  PubMed  CAS  Google Scholar 

  22. Altschul S, Gish W, Miller W, Myers E, Lipman DJ (1990) Basic local alignment search tool. J Mol Biol 215(3):403–410

    PubMed  CAS  Google Scholar 

  23. Altschul S, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ (1997) Gapped blast and psi-blast: a new generation of protein database search programs. Nucleic Acids Res 25:3389–3402

    Article  PubMed  CAS  Google Scholar 

  24. Kielbasa SM, Wan R, Sato K, Horton P, Frith MC (2011) Adaptive seeds tame genomic sequence comparison. Genome Res 21(3):487–493

    Article  PubMed  CAS  Google Scholar 

  25. Hohwald H, Thayer I, Korf RE (2003) Comparing best-first search and dynamic programming for optimal multiple sequence alignment. In: Proceedings of the 18th international joint conference on artificial intelligence, IJCAI’03. Morgan Kaufmann Publishers, San Francisco, pp 1239–1245

    Google Scholar 

  26. Korf RE, Zhan W (2000) Divide-and-conquer frontier search applied to optimal sequence alignment. In: Proceedings of the 7th conference on artificial intelligence (AAAI-00) and of the 12th conference on innovative applications of artificial intelligence (IAAI-00). AAA1 Press, Cambridge, MA, pp 910–916

    Google Scholar 

  27. Lipman DJ, Altschul SF, Kececioglu JD (1989) A tool for multiple sequence alignment. Proc Natl Acad Sci USA 86:4412–4415

    Article  PubMed  CAS  Google Scholar 

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

    Article  Google Scholar 

  29. Sobel E, Martinez HM (1986) A multiple sequence alignment program. Nucleic Acids Res 14(1):363–374

    Article  PubMed  CAS  Google Scholar 

  30. Morgenstern B, Frech K, Dress A, Werner T (1998) Dialign: finding local similarities by multiple sequence alignment. Bioinformatics 14(3):290–294

    Article  PubMed  CAS  Google Scholar 

  31. Thompson JD, Higgins DG, Gibson TJ (1994) Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res 22:4673–4680

    Article  PubMed  CAS  Google Scholar 

  32. Notredame C, Higgins DG, Heringa J (2000) T-coffee: a novel method for fast and accurate multiple sequence alignment. J Mol Biol 302:205–217

    Article  PubMed  CAS  Google Scholar 

  33. Edgar RC (2004) Muscle: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res 32(5):1792–1797

    Article  PubMed  CAS  Google Scholar 

  34. Katoh K, Misawa K, Kuma K, Miyata T (2002) MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res 30:3059–3066

    Article  PubMed  CAS  Google Scholar 

  35. Russell DJ, Otu HH, and Sayood K (2008) Grammar-based distance in progressive multiple sequence alignment. BMC Bioinformatics, 9:306

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Nebraska-Lincoln, Lincoln, NE, USA

    Ö. Ufuk Nalbantoğlu

Authors
  1. Ö. Ufuk Nalbantoğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical Engineering, University of Nebraska-Lincoln, Lincoln, Nebraska, USA

    David J Russell

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media, LLC

About this protocol

Cite this protocol

Nalbantoğlu, Ö.U. (2014). Dynamic Programming. In: Russell, D. (eds) Multiple Sequence Alignment Methods. Methods in Molecular Biology, vol 1079. Humana Press, Totowa, NJ. https://doi.org/10.1007/978-1-62703-646-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-62703-646-7_1

  • Published:

  • Publisher Name: Humana Press, Totowa, NJ

  • Print ISBN: 978-1-62703-645-0

  • Online ISBN: 978-1-62703-646-7

  • eBook Packages: Springer Protocols

Publish with us

Policies and ethics

Search

Navigation