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
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
Hi-index | 0.89 |
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.