Skip to main content
Figure 1 | BMC Bioinformatics

Figure 1

From: Progressive multiple sequence alignments from triplets

Figure 1

Dynamic programming recursions for three-way alignments with affine gap costs. The empty alignments are initialized as M(0, 0, 0) = 0 and I..(0,0,0) = 0. The boundaries of the cubic tables are initialized using the recursions above with the understanding that alternatives with negative indices are ignored.

Back to article page