Reversals of Fortune

Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three examples, all of which are hard: 1) Orientation assignment for unsigned genomes. 2 ) Ortholog identification in the presence of multiple copies of genes. 3) Linearisation of partially ordered genomes. The comparison of traditional genetic maps by rearrangement algorithms poses all these problems. We combine heuristics for the first two problems with an exact algorithm for the third to solve a moderate-sized instance comparing maps of cereal genomes.

• Type: Conference
• Year: 2005
• Where: RECOMB
• Authors: David Sankoff, Chunfang Zheng, Aleksander Lenert
• Keywords: Computational Biology, Genome Rearrangement Problems, Instance Comparing Maps, RECOMB 2005, Traditional Genetic Maps