Approximating the number of Double Cut-and-Join scenarios - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2012

Approximating the number of Double Cut-and-Join scenarios

Abstract

The huge number of solutions in genome rearrangement problems calls for algorithms for counting and sampling in the space of solutions, rather than drawing one arbitrary scenario. A closed formula exists for counting the number of DCJ scenarios between co-tailed genomes, but no polynomial result has been published so far for arbitrary genomes. We prove here that it admits a Fully Polynomial time Randomized Approximation Scheme. We use an MCMC almost uniform sampler and prove that it converges to the uniform distribution in fully polynomial time. The MCMC can be used to quickly draw a sample of DCJ scenarios from a prescribed distribution and test some hypotheses on genome evolution.

Dates and versions

hal-00699567 , version 1 (21-05-2012)

Identifiers

Cite

Istvan Miklos, Eric Tannier. Approximating the number of Double Cut-and-Join scenarios. Theoretical Computer Science, 2012, 439, pp.30-40. ⟨10.1016/j.tcs.2012.03.006⟩. ⟨hal-00699567⟩
169 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More