Improving the divide-and-conquer approac
โ
J. Stoye; S.W. Perrey; A.W.M. Dress
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 419 KB
We consider the problem of multiple sequence alignment: given k sequences of length at most n and a certain scoring function, find an alignment that minimizes the corresponding "sum of pairs" distance score. We generalize the divide-and-conquer technique described in [1,2], and present new ideas on