Genome rearrangements with duplications

  title={Genome rearrangements with duplications},
  author={Martin Bader},
  booktitle={BMC Bioinformatics},
Finding sequences of evolutionary operations that transform one genome into another is a classical problem in comparative genomics. While most of the genome rearrangement algorithms assume that there is exactly one copy of each gene in both genomes, this does not reflect the biological reality very well - most of the studied genomes contain duplicated gene content, which has to be removed before applying those algorithms. However, dealing with unequal gene content is a very challenging task… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 15 extracted citations

A 2-Approximation Scheme for Sorting Signed Permutations by Reversals, Transpositions, Transreversals, and Block-Interchanges.

IEEE/ACM transactions on computational biology and bioinformatics • 2017
View 10 Excerpts
Highly Influenced

Sorting by Cuts, Joins, and Whole Chromosome Duplications

Journal of Computational Biology • 2017
View 1 Excerpt


Publications referenced by this paper.

Similar Papers

Loading similar papers…