Approximating the number of Double Cut-and-Join scenarios

作者：Miklos Istvan^*; Tannier Eric

来源：Theoretical Computer Science, 2012, 439: 30-40.

DOI：10.1016/j.tcs.2012.03.006

• Comparative genomics
• Genome rearrangement
• FPRAS
• DCJ
• MCMC

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.

• 出版日期2012-6-29
• 单位INRIA