Title: A Probabilistic Model of Local Sequence Alignment That Simplifies Statistical Significance Estimation
Authors: Eddy, S.E.
Speaker: Viann Chan
Department of Computer Science, University of British Columbia

Sequence database searches require accurate estimation of the statistical significance of scores. Optimal local sequence alignment scores follow Gumbel distributions, but determining an important parameter of the distribution (.) requires time-consuming computational simulation. Moreover, optimal alignment scores are less powerful than probabilistic scores that integrate over alignment uncertainty (.Forward. scores), but the expected distribution of Forward scores remains unknown. Here, I conjecture that both expected score distributions have simple, predictable forms when full probabilistic modeling methods are used. For a probabilistic model of local sequence alignment, optimal alignment bit scores (.Viterbi. scores) are Gumbel-distributed with constant . = log 2, and the high scoring tail of Forward scores is exponential with the same constant .. Simulation studies support these conjectures over a wide range of profile/sequence comparisons, using 9,318 profile-hidden Markov models from the Pfam database. This enables efficient and accurate determination of expectation values (E-values) for both Viterbi and Forward scores for probabilistic local alignments.

Available here