English

On the Complexity of Minimum Labeling Alignment of Two Genomes

Computational Complexity 2012-06-12 v1 Data Structures and Algorithms Genomics

Abstract

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

Keywords

Cite

@article{arxiv.1206.1877,
  title  = {On the Complexity of Minimum Labeling Alignment of Two Genomes},
  author = {Riccardo Dondi and Nadia El-Mabrouk},
  journal= {arXiv preprint arXiv:1206.1877},
  year   = {2012}
}