Multiple Sequence Alignment as a Facility-Location Problem

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 MA...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:INFORMS journal on computing Jg. 16; H. 4; S. 430 - 440
Hauptverfasser: Just, Winfried, Vedova, Gianluca Della
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Linthicum INFORMS 01.11.2004
Institute for Operations Research and the Management Sciences
Schlagworte:
Algorithms
analysis of algorithms: computational complexity
Computer science
Correlation analysis
facilities-equipment planning: location
Studies
ISSN:1091-9856, 1526-5528, 1091-9856
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1091-9856
1526-5528
1091-9856
DOI:10.1287/ijoc.1040.0093