Significance of gapped sequence alignments

Journal of Computational Biology

Volumn 15, Issue 9, 2008, Pages 1187-1194

  Newberg, Lee A ^a,b  

^a WADSWORTH CENTER   (United States)

^b Rensselaer Polytechnic Institute   (United States)

Author keywords

Alignment; Dynamic programming; Genomics; Phylogenetic trees; Regulatory regions

Indexed keywords

AMINO ACID SEQUENCE; ARTICLE; BLOSUM62 SCORING SYSTEM; GAPPED SEQUENCE ALIGNMENT; GENE REGULATORY NETWORK; GUMBEL DISTRIBUTION; INTERNET; MATHEMATICAL COMPUTING; MATHEMATICAL GENETICS; NONHUMAN; NUCLEOTIDE SEQUENCE; PHYLOGENETIC TREE; PRIORITY JOURNAL; PROBABILITY; SCORING SYSTEM; SEQUENCE ALIGNMENT SCORE; SEQUENCE ANALYSIS;

AMINO ACID SEQUENCE; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; MODELS, STATISTICAL; PROBABILITY; SEQUENCE ALIGNMENT;

EID: 55249092719     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2008.0125     Document Type: Article

References (13)

1. Durbin, R., Eddy, S., Krogh, A., et al. 2006. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge, UK.
2. Eddy, S.R. 2008. A probabilistic model of local sequence alignment that simplifies statistical significance estimation. PLoS Comput. Biol. 4, e1000069.
3. Hartmann, A.K. 2002. Sampling rare events: statistics of local sequence alignments. Phys. Rev. E 65, 056102.
4. Karlin, S., and Altschul, S.F. 1990. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proc. Natl. Acad. Sci. USA 87, 2264-2268.
5. Liu, J.S. 2001. Monte Carlo strategies in scientific computing. Springer Series in Statistics. Springer-Verlag, New York.
6. Mitrophanov, A.Y., and Borodovsky, M. 2006. Statistical significance in biological sequence analysis. Brief Bioinform. 7, 2-24.
7. Needleman, S.B., and Wunsch, C.D. 1970. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443-453.
8. Newberg, L.A. 2008. Memory-efficient dynamic programming backtrace and pairwise local sequence alignment. Bioinformatics 24, 1772-1778.
9. Pearson, W.R. 1991. Searching protein sequence libraries: comparison of the sensitivity and selectivity of the Smith-Waterman and FASTA algorithms. Genomics 11, 635-650.
10. Rabiner, L.R., and Juang, B.-H. 1986. An introduction to hidden Markov models. IEEE ASSP Mag. 3, 4-16.
11. Smith, T.F., and Waterman, M.S. 1981. Identification of common molecular subsequences. J. Mol. Biol. 147, 195-197.
12. Viterbi, A.J. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theory 13, 260-269.
13. Wolfsheimer, S., Burghardt, B., and Hartmann, A.K. 2007. Local sequence alignments statistics: deviations from gumbel statistics in the rare-event tail. Algorithms Mol. Biol. 2, 9.