๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment

โœ Scribed by J. Stoye; S.W. Perrey; A.W.M. Dress


Book ID
104349889
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
419 KB
Volume
10
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 how to use efficient search strategies for saving computer memory and accelerating the procedure for three or more sequences. Resulting running times and memory usage are shown for several test cases.


๐Ÿ“œ SIMILAR VOLUMES