Ordering partially assembled genomes using gene arrangements

Authors:
Éric Gaul;Mathieu Blanchette
Affiliations:
McGill Centre for Bioinformatics, McGill University;McGill Centre for Bioinformatics, McGill University
Venue:
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Year:
2006

Citing 5
Cited 2

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Genome Halving

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Reversal distance for partially ordered genomes

Bioinformatics
Efficient sorting of genomic permutations by translocation, inversion and block interchange

Bioinformatics
A very elementary presentation of the Hannenhalli-Pevzner theory

Discrete Applied Mathematics

Rearrangement Phylogeny of Genomes in Contig Form

ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
Rearrangement Phylogeny of Genomes in Contig Form

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

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.