On the approximability of comparing genomes with duplicates.

Angibaud, Sébastien, et al. "On the approximability of comparing genomes with duplicates.." Journal of Graph Algorithms and Applications 13.1 (2009): 19-53. <http://eudml.org/doc/55913>.

@article{Angibaud2009,
author = {Angibaud, Sébastien, Fertin, Guillaume, Rusu, Irena, Thévenin, Annelyse, Vialette, Stéphane},
journal = {Journal of Graph Algorithms and Applications},
keywords = {genome rearrangements; APX-hardness; duplicate genes; breakpoints; adjacencies; common intervals; conserved intervals; approximation algorithms},
language = {eng},
number = {1},
pages = {19-53},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {On the approximability of comparing genomes with duplicates.},
url = {http://eudml.org/doc/55913},
volume = {13},
year = {2009},
}

TY - JOUR
AU - Angibaud, Sébastien
AU - Fertin, Guillaume
AU - Rusu, Irena
AU - Thévenin, Annelyse
AU - Vialette, Stéphane
TI - On the approximability of comparing genomes with duplicates.
JO - Journal of Graph Algorithms and Applications
PY - 2009
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 13
IS - 1
SP - 19
EP - 53
LA - eng
KW - genome rearrangements; APX-hardness; duplicate genes; breakpoints; adjacencies; common intervals; conserved intervals; approximation algorithms
UR - http://eudml.org/doc/55913
ER -