Ordering Partially Assembled Genomes Using Gene Arrangements

  • Éric Gaul
  • Mathieu Blanchette
Conference paper

DOI: 10.1007/11864127_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4205)
Cite this paper as:
Gaul É., Blanchette M. (2006) Ordering Partially Assembled Genomes Using Gene Arrangements. In: Bourque G., El-Mabrouk N. (eds) Comparative Genomics. RCG 2006. Lecture Notes in Computer Science, vol 4205. Springer, Berlin, Heidelberg

Abstract

Several mammalian genomes will only be sequenced at a 2X coverage, resulting in the impossibility of assembling contigs into chromosomes. We introduce the problem of ordering the contigs of two partially assembled genomes so as to maximize the similarity (measured in terms of genome rearrangements) between the assembled genomes. We give a linear-time algorithm for the Block Ordering Problem (BOP): Given two signed permutations (genomes) that are been broken into blocks (contigs), order and orient each set of blocks, in such a way that the number of cycles in the breakpoint graph of the resulting permutations is maximized. We illustrate our algorithm on a set of 90 markers from the human and mouse chromosomes X and show how the size of the contigs and the rearrangement distance between the two genomes affects the accuracy of the predicted assemblies. The appendix and an implementation are available at www.mcb.mcgill.ca/~egaul/recomb2006.

Keywords

Genome rearrangement gene order breakpoint graph genome assembly 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Éric Gaul
    • 1
  • Mathieu Blanchette
    • 1
  1. 1.McGill Centre for BioinformaticsMcGill University 

Personalised recommendations