TY  - JOUR
AB  - A large number of methods for multiple sequence alignment are currenty available. Recent benchmarking tests demonstrated that strengths and drawbacks of these methods differ substantially. Global strategies can be outperformed by approaches based on local similarities and vice versa, depending on the characteristics of the input sequences. In recent years, mixed approaches that include both global and local features have shown promising results. Herein, we introduce a new algorithm for multiple sequence alignment that integrates the global divide-and-conquer approach with the local segment-based approach, thereby combining the strengths of those two strategies.
DA  - 2003
DO  - 10.1093/bioinformatics/btg1077
LA  - eng
IS  - Suppl 2
M2  - ii189
PY  - 2003
SN  - 1367-4803
SP  - ii189-ii195
T2  - BIOINFORMATICS
TI  - Divide-and-conquer multiple alignment with segment-based constraints
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-16094031
Y2  - 2024-11-22T02:56:58
ER  -