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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:INFORMS journal on computing Ročník 16; číslo 4; s. 430 - 440
Hlavní autoři: Just, Winfried, Vedova, Gianluca Della
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.11.2004
Institute for Operations Research and the Management Sciences
Témata:
Algorithms
analysis of algorithms: computational complexity
Computer science
Correlation analysis
facilities-equipment planning: location
Studies
ISSN:1091-9856, 1526-5528, 1091-9856
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1091-9856
1526-5528
1091-9856
DOI:10.1287/ijoc.1040.0093