Genomes Containing Duplicates Are Hard to Compare

DOI10.1007/11758525_105zbMATH Open1155.68395OpenAlexW1555413501MaRDI QIDQ3545133FDOQ3545133

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

Recommendations

• On the Approximability of Comparing Genomes with Duplicates
• On the Approximability of Comparing Genomes with Duplicates
• Whole genome duplications, multi-break rearrangements, and genome halving problem
• scientific article; zbMATH DE number 1303034

Mathematics Subject Classification ID

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

Cited In (4)

• On the Approximability of Comparing Genomes with Duplicates
• Exemplar or matching: modeling DCJ problems with unequal content genome data
• On the Approximability of Comparing Genomes with Duplicates
• Computing and Combinatorics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545133)