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

Full description

Saved in:
Bibliographic Details
Published in:INFORMS journal on computing Vol. 16; no. 4; pp. 430 - 440
Main Authors: Just, Winfried, Vedova, Gianluca Della
Format: Journal Article
Language:English
Published: Linthicum INFORMS 01.11.2004
Institute for Operations Research and the Management Sciences
Subjects:
Algorithms
analysis of algorithms: computational complexity
Computer science
Correlation analysis
facilities-equipment planning: location
Studies
ISSN:1091-9856, 1526-5528, 1091-9856
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1091-9856
1526-5528
1091-9856
DOI:10.1287/ijoc.1040.0093