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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.