On the Complexity of Minimum Labeling Alignment of Two Genomes

Abstract

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

Cited by in corpus (1)

• A Branch-and-Cut Algorithm for the 2-Species Duplication-Loss Phylogeny Problem