Assume that two sequences from a finite alphabet are optimally
aligned according to a scoring system that rewards similarities according to a
general scoring scheme and penalizes gaps (insertions and deletions). Under the
assumption that the letters in each sequence are independent and identically
distributed and the two sequences are also independent, approximate $p$-values
are obtained for the optimal local alignment when either (i) there are at most
a fixed number of gaps, or (ii) the gap initiation cost is sufficiently large.
In the latter case the approximation can be written in the same form as the
well-known case of ungapped alignments.
Publié le : 2000-05-14
Classification:
Sequence alignment,
$p$-value,
gaps,
large deviations,
62M40,
92D10
@article{1015951993,
author = {Siegmund, David and Yakir, Benjamin},
title = {Approximate $p$-values for local sequence alignments},
journal = {Ann. Statist.},
volume = {28},
number = {3},
year = {2000},
pages = { 657-680},
language = {en},
url = {http://dml.mathdoc.fr/item/1015951993}
}
Siegmund, David; Yakir, Benjamin. Approximate $p$-values for local sequence alignments. Ann. Statist., Tome 28 (2000) no. 3, pp. 657-680. http://gdmltest.u-ga.fr/item/1015951993/