On the Complexity of Minimum Labeling Alignment of Two Genomes
classification
💻 cs.CC
cs.DSq-bio.GN
keywords
alignmentcomplexityminimumproblemapx-hardgenomesinvestigatelabel
read the original abstract
In this note we investigate the complexity of the Minimum Label Alignment problem and we show that such a problem is APX-hard.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.