Fig. 13

Dynamic programming algorithm for the E2pair model. Dynamic programming algorithm to calculate the probability of two sequences related by a common ancestor by summing to all ancestors and to all evolutionary histories. The algorithm behaves as O(l1×l2) both in time and memory for two sequences of lengths l1 and l2. The parameters of the model have been described in Fig. 11. The algorithm assumes that the internal nodes are “profile” sequences, that is, sequences that instead of a fixed residue per position, they have a probability distribution of residues for each position \({p^{1}_{x}}(a),{p^{2}_{x}}(a)\). This generalization becomes useful when we extend this pairwise algorithm to perform a progressive alignment, and we align internal nodes of the tree. Internal node sequences are estimated from the E2pair algorithm by the optimal posterior path through the model