Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Miklós, I.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Miklós, I.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 19 Suppl. 2 2003
pages ii130-ii137
© 2003 Oxford University Press

MCMC genome rearrangement

István Miklós

Department of Statistics, University of Oxford, Oxford, OX1 3TG, UK

Received on March 17, 2003 ; accepted on June 9, 2003

Motivation: As more and more genomes have been sequenced, genomic data is rapidly accumulating. Genome-wide mutations are believed more neutral than local mutations such as substitutions, insertions and deletions, therefore phylogenetic investigations based on inversions, transpositions and inverted transpositions are less biased by the hypothesis on neutral evolution. Although efficient algorithms exist for obtaining the inversion distance of two signed permutations, there is no reliable algorithm when both inversions and transpositions are considered. Moreover, different type of mutations happen with different rates, and it is not clear how to weight them in a distance based approach.

Results: We introduce a Markov Chain Monte Carlo method to genome rearrangement based on a stochastic model of evolution, which can estimate the number of different evolutionary events needed to sort a signed permutation. The performance of the method was tested on simulated data, and the estimated numbers of different types of mutations were reliable. Human and Drosophila mitochondrial data were also analysed with the new method. The mixing time of the Markov Chain is short both in terms of CPU times and number of proposals.

Availability: The source code in C is available on request from the author.

Contact: miklos{at}stats.ox.ac.uk


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Genome ResHome page
H. Zhao and G. Bourque
Recovering genome rearrangements in the mammalian phylogeny
Genome Res., May 1, 2009; 19(5): 934 - 942.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
A. Esteban-Marcos, A. E. Darling, and M. A. Ragan
Seevolution: visualizing chromosome evolution
Bioinformatics, April 1, 2009; 25(7): 960 - 961.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
I. Miklos, P. Ittzes, and J. Hein
ParIS Genome Rearrangement server
Bioinformatics, March 15, 2005; 21(6): 817 - 820.
[Abstract] [Full Text] [PDF]

Home page
 Mol Biol EvolHome page
B. Larget, D. L. Simon, J. B. Kadane, and D. Sweet
A Bayesian Analysis of Metazoan Mitochondrial Genome Arrangements
Mol. Biol. Evol., March 1, 2005; 22(3): 486 - 495.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.