Non-approximability of weighted multiple sequence alignment for arbitrary metrics

Authors:
Bodo Manthey
Affiliations:
Universität zu Lübeck, Institut für Theoretische Informatik, Ratzeburger Allee 160, 23538 Lübeck, Germany
Venue:
Information Processing Letters
Year:
2005

Citing 6
Cited 1

Approximation algorithms for multiple sequence alignment

Theoretical Computer Science
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

SIAM Journal on Computing
Some open problems in computational molecular biology

Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Non-approximability of weighted multiple sequence alignment

Theoretical Computer Science - Computing and combinatorics
A tight bound on approximating arbitrary metrics by tree metrics

Journal of Computer and System Sciences - Special issue: STOC 2003

Inapproximability of maximal strip recovery

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We prove that the multiple sequence alignment problem with weighted sum-of-pairs score is APX-hard for arbitrary metric scoring functions over the binary alphabet. This holds even when the weights are restricted to zero and one.