Multiple Sequence Alignment as a Facility-Location Problem

Authors:
Winfried Just;Gianluca Della Vedova
Affiliations:
Department of Mathematics, Ohio University, Athens, Ohio 45701, USA;Dipartimento di Statistica, Università degli Studi di Milano-Bicocca, Edificio U7, via Bicocca degli Arcimboldi 8, 20126 Milano, Italy
Venue:
INFORMS Journal on Computing
Year:
2004

Citing 12
Cited 1

Multiple alignment, communication cost, and graph matching

SIAM Journal on Applied Mathematics
A distance constrained p-facility location problem on the real line

Mathematical Programming: Series A and B
Approximation algorithms for multiple sequence alignment

Theoretical Computer Science
Polynomial time approximation schemes for dense instances of NP -hard problems

Journal of Computer and System Sciences
Some open problems in computational molecular biology

ACM SIGACT News
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

SIAM Journal on Computing
A polylogarithmic approximation algorithm for the group Steiner tree problem

Journal of Algorithms
The complexity of multiple sequence alignment with SP-score that is a metric

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding similar regions in many sequences

Journal of Computer and System Sciences - STOC 1999
Hardness of Approximating Problems on Cubic Graphs

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Non-approximability of weighted multiple sequence alignment

Theoretical Computer Science - Computing and combinatorics

Optimal global alignment of signals by maximization of Pearson correlation

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.