Genomes Containing Duplicates Are Hard to Compare

DOI10.1007/11758525_105zbMath1155.68395OpenAlexW1555413501MaRDI QIDQ3545133

Romeo Rizzi, Guillaume Fertin, Stéphane Vialette, Cedric Chauve

Publication date: 9 December 2008

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758525_105

Mathematics Subject Classification ID

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

Related Items (2)

Exemplar or matching: modeling DCJ problems with unequal content genome data ⋮ On the Approximability of Comparing Genomes with Duplicates

This page was built for publication: Genomes Containing Duplicates Are Hard to Compare