Skip to main content

Biological Sequence Analysis: Algorithms and Statistical Methods

  • Protocol
  • First Online:
Analyzing Microbes

Part of the book series: Springer Protocols Handbooks ((SPH))

  • 2433 Accesses

Abstract

With the increase in huge amount of biological sequence data from large genome and proteome sequencing projects, efforts have been made to develop computational algorithms and databases to manage the information. This chapter is an attempt to highlight some of the commonly used algorithms for the biological sequence analysis ranging from pairwise sequence analysis, multiple sequence analysis, phylogenetic analysis, and prediction of the probability of a desired motif in the sequence. The chapter is organized in the form of basic questions that arise in the researchers’ mind and their step-by-step solution using important algorithms and statistical methods. The examples are used and elaborated in such a way that the algorithms can be easily understood by students with nonmathematical and nonstatistical background.

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

Access this chapter

Protocol
USD 49.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.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. Needleman SB, Wunsch CD (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 48:443–453

    Article  PubMed  CAS  Google Scholar 

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

    Article  PubMed  CAS  Google Scholar 

  3. Zhang Z, Schwartz S, Wagner L, Miller W (2000) A greedy algorithm for aligning DNA sequences. J Comput Biol 7:203–214

    Article  PubMed  CAS  Google Scholar 

  4. Feng DF, Doolittle RF (1987) Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J Mol Evol 25:351–360

    Article  PubMed  CAS  Google Scholar 

  5. Bucka-Lassen K, Caprani O, Hein J (1999) Combining many multiple alignments in one improved alignment. Bioinformatics 15: 122–130

    Article  PubMed  CAS  Google Scholar 

  6. Bruno WJ, Socci ND, Halpern AL (2000) Weighted neighbor joining: a likelihood-based approach to distance-based phylogeny reconstruction. Mol Biol Evol 17:189–197

    Article  PubMed  CAS  Google Scholar 

  7. Baum LE, Petrie T (1966) Statistical inference for probabilistic functions of finite state Markov chains. Ann Math Stat 37:1554–1563

    Article  Google Scholar 

  8. Forney GD (1973) The Viterbi algorithm. Proc IEEE 61:268–278

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this protocol

Cite this protocol

Smita, S., Singh, K.P., Akhoon, B.A., Gupta, S.K. (2013). Biological Sequence Analysis: Algorithms and Statistical Methods. In: Arora, D., Das, S., Sukumar, M. (eds) Analyzing Microbes. Springer Protocols Handbooks. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34410-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34410-7_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34409-1

  • Online ISBN: 978-3-642-34410-7

  • eBook Packages: Springer Protocols

Publish with us

Policies and ethics