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

DOI10.1007/978-3-642-02017-9_10zbMath1241.68073OpenAlexW2103122162MaRDI QIDQ3630191

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

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

Related Items (5)

A NOTE ON COMPLEXITY OF GENETIC MUTATIONS ⋮ Maximal strip recovery problem with gaps: hardness and approximation algorithms ⋮ The Potential of Family-Free Genome Comparison ⋮ Robust Optimization for the Hazardous Materials Transportation Network Design Problem ⋮ Robust optimization for the hazardous materials transportation network design problem

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