On the approximability of comparing genomes with duplicates.
Angibaud, Sébastien ; Fertin, Guillaume ; Rusu, Irena ; Thévenin, Annelyse ; Vialette, Stéphane
Journal of Graph Algorithms and Applications, Tome 13 (2009), p. 19-53 / Harvested from The Electronic Library of Mathematics
Publié le : 2009-01-01
EUDML-ID : urn:eudml:doc:55913
@article{05554824,
     title = {On the approximability of comparing genomes with duplicates.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {13},
     year = {2009},
     pages = {19-53},
     zbl = {1170.68049},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05554824}
}
Angibaud, Sébastien; Fertin, Guillaume; Rusu, Irena; Thévenin, Annelyse; Vialette, Stéphane. On the approximability of comparing genomes with duplicates.. Journal of Graph Algorithms and Applications, Tome 13 (2009) pp. 19-53. http://gdmltest.u-ga.fr/item/05554824/