title: Genome rearrangements with duplications.
abstract: BACKGROUND
  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, and only few algorithms allow operations like duplications and deletions, especially if the duplicated or deleted segments are of arbitrary size.
  
  
  RESULTS
  We recently proposed a heuristic algorithm for sorting unichromosomal genomes by reversals, block interchanges, tandem duplications, and deletions. In this paper, we extend this approach to multichromosomal genomes. We are now able to sort a multichromosomal ancestral genome into a genome of a descendant by a large set of different operations, including tandem duplications and deletions of segments of arbitrary size.
  
  
  CONCLUSIONS
  Experimental results show that our algorithm finds sorting sequences that have a weight close to the true evolutionary distance.
authors.affiliation: Institute of Theoretical Computer Science, Ulm University, 89069 Ulm, Germany. martin.bader@uni-ulm.de
authors.forename: Martin
authors.initials: M
authors.lastname: Bader
mesh_terms: D000465:Algorithms; D019143:Evolution, Molecular; D020440:Gene Duplication; D015321:Gene Rearrangement; D016678:Genome; D023281:Genomics / Q000379:methods*