...problem.

Masek and Paterson have developed an 7#7 algorithm for strings of equal length from a finite alphabet with a minor restriction on the cost function. It will be faster for values of n greater than 263000, and is not amenable to parallelization [23].

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...doubling.

Typical experiments have model lengths of 100-500, and a maximum sequence length of up to a couple thousand.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...optimized).

The MP-2 features an ALU approximately eight times faster than the MP-1's. The bandwidth to each PEs local memory, which doubled between the two models, is the limiting factor.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.