| Article ID: | iaor200758 |
| Country: | United States |
| Volume: | 16 |
| Issue: | 4 |
| Start Page Number: | 430 |
| End Page Number: | 440 |
| Publication Date: | Sep 2004 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Just Winfried, Vedova Gianluca Della |
| Keywords: | computational analysis, biology |
A connection is made between certain multiple-sequence alignment problems and facility-location problems, and the existence of a PTAS (polynomial-time approximation scheme) for these problems is shown. Moreover, it is shown that multiple sequence alignment with SP-score and fixed gap penalties is MAX SNP-hard.