TY  - JOUR
AB  - 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.
DA  - 1997
DO  - 10.1016/S0893-9659(97)00013-X
KW  - Dynamic programming
KW  - Multiple sequence alignment
KW  - Divide-and-conquer
LA  - eng
IS  - 2
M2  - 67
PY  - 1997
SN  - 0893-9659
SP  - 67-73
T2  - Applied mathematics letters
TI  - Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17733553
Y2  - 2024-11-22T05:33:43
ER  -