Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species

  1. Guillaume Bourque1,3 and
  2. Pavel A. Pevzner2
  1. 1Department of Mathematics, University of Southern California, California 90089, USA; 2Department of Computer Science and Engineering, University of California, San Diego, La Jolla, California 92093, USA

Abstract

Recent progress in genome-scale sequencing and comparative mapping raises new challenges in studies of genome rearrangements. Although the pairwise genome rearrangement problem is well-studied, algorithms for reconstructing rearrangement scenarios for multiple species are in great need. The previous approaches to multiple genome rearrangement problem were largely based on the breakpoint distance rather than on a more biologically accurate rearrangement (reversal) distance. Another shortcoming of the existing software tools is their inability to analyze rearrangements (inversions, translocations, fusions, and fissions) of multichromosomal genomes. This paper proposes a new multiple genome rearrangement algorithm that is based on the rearrangement (rather than breakpoint) distance and that is applicable to both unichromosomal and multichromosomal genomes. We further apply this algorithm for genome-scale phylogenetic tree reconstruction and deriving ancestral gene orders. In particular, our analysis suggests a new improved rearrangement scenario for a very difficultCampanulaceae cpDNA dataset and a putative rearrangement scenario for human, mouse and cat genomes.

Footnotes

  • 3 Corresponding author.

  • E-MAIL gbourque{at}usc.edu; FAX (213) 740-2424

  • Article and publication are at www.genome.org/cgi/doi/

| Table of Contents

Preprint Server