Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes

DOI10.1007/11809678_27zbMath1162.68450OpenAlexW1494263671MaRDI QIDQ3591316

Zhixiang Chen, Bin Fu, Richard H. Fowler, Binhai Zhu

Publication date: 10 September 2007

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

Full work available at URL: https://doi.org/10.1007/11809678_27

Mathematics Subject Classification ID

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

Related Items (3)

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions ⋮ On the inapproximability of the exemplar conserved interval distance problem of genomes ⋮ A Retrospective on Genomic Preprocessing for Comparative Genomics

This page was built for publication: Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes