动态规划法——双序列比对.pptVIP

* /55 Local Alignment: Example * /55 Local Alignment: Example * /55 Local Alignment: Example * /55 Local Alignment: Example * /55 Local Alignment: Running Time Long run time O(n4): - In the grid of size n x n there are ~n2 vertices (i,j) that may serve as a source. - For each such vertex computing alignments from (i,j) to (i’,j’) takes O(n2) time. This can be remedied by giving free rides * /55 Local Alignment: Free Rides Vertex (0,0) The dashed edges represent the free rides from (0,0) to every other node. Yeah, a free ride! * /55 The Local Alignment Recurrence The largest value of