Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems

DOI10.1007/978-3-642-02017-9_10MaRDI QIDQ3630191zbMATH OpenOpenAlexFDO

Authors Binhai Zhu

Publication date 3 June 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_10

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Genetics and epigenetics (92D10)

Recommendations

• The Approximability of the Exemplar Breakpoint Distance Problem
• Tractability and approximability of maximal strip recovery
• On the Tractability of Maximal Strip Recovery
• The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
• On the inapproximability of the exemplar conserved interval distance problem of genomes

Cited in

(11)

• Robust optimization for the hazardous materials transportation network design problem
• On the inapproximability of the exemplar conserved interval distance problem of genomes
• Maximal strip recovery problem with gaps: hardness and approximation algorithms
• Robust optimization for the hazardous materials transportation network design problem
• A note on complexity of genetic mutations
• Erratum: ``The approximability of the exemplar breakpoint distance problem
• Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes
• The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
• The potential of family-free genome comparison
• The Approximability of the Exemplar Breakpoint Distance Problem
• The complexity of calculating exemplar distances

This page was built for publication: Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630191)