Genome rearrangement in mitochondria and its computational biology

István Miklós, Jotun Hein

Research output: Contribution to journalConference article

9 Citations (Scopus)

Abstract

In the first part of this paper, we investigate gene orders of closely related mitochondrial genomes for studying the properties of mutations rearranging genes in mitochondria. Our conclusions are that the evolution of mitochondrial genomes is more complicated than it is considered in recent methods, and stochastic modelling is necessary for its deeper understanding and more accurate inferring. The second part is a review on the Markov chain Monte Carlo approaches for the stochastic modelling of genome rearrangement, which seem to be the only computationally tractable way to this problem. We introduce the concept of partial importance sampling, which yields a class of Markov chains being efficient both in terms of mixing and computational time. We also give a list of open algorithmic problems whose solution might help improve the efficiency of partial importance samplers.

Original languageEnglish
Pages (from-to)85-96
Number of pages12
JournalLecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science)
Volume3388
DOIs
Publication statusPublished - 2005
EventRECOMB 2004 International Workshop, RRCG 2004 - Comparative Genomics - Bertinoro, Italy
Duration: Oct 16 2004Oct 19 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Genome rearrangement in mitochondria and its computational biology'. Together they form a unique fingerprint.

  • Cite this