ppt课件-approximation algorithms（近似算法）.pptVIP

* * * * * * * * * * * * * * * * Randomized Alignments Theorem 3.2For any r 1, let e(r) be the expected number of stars needed to be chosen at random before the value of best resulting alignment is within a factor of 2+1/(r-1) of the optimal alignment. Then e(r) ≤ r. e(r) is independent of k and the length of the strings. Proof of Theorem 3.2 For r = 2, for each string Xi define M(i) = ΣjD(Xi,Xj) then M(c) = M From Theorem 3.1, Σ(i,j)D(Xi,Xj) = ΣjM(i) ≤ 2(k-1)M so the Avg value of M(i) 2 M Since min M(i) = M, then Median M(i) 3M Number of centers selected before a selected M(i) is less