On the Complexity of Minimum Labeling Alignment of Two Genomes

TL;DR

This paper proves that the problem of minimum labeling alignment of two genomes is computationally hard to approximate within certain bounds, highlighting its complexity in computational biology.

Contribution

It establishes that the Minimum Label Alignment problem is APX-hard, demonstrating its computational difficulty and providing insights into genome comparison challenges.

Findings

Minimum Label Alignment is APX-hard

The problem is computationally intractable for exact solutions

Implications for genome analysis algorithms

Abstract

In this note we investigate the complexity of the Minimum Label Alignment problem and we show that such a problem is APX-hard.