Abstract

The random reversal graph offers new perspectives, allowing to study the connectivity of genomes as well as their most likely distance as a function of the reversal rate. Our main result shows that the structure of the random reversal graph changes dramatically at λn=1/(n+12)λ_n=1/\binom{n+1}{2}. For λn=(1−ε)/(n+12)λ_n=(1-ε)/\binom{n+1}{2}, the random graph consists of components of size at most O(nln⁡(n))O(n\ln(n)) a.s. and for (1+ε)/(n+12)(1+ε)/\binom{n+1}{2}, there emerges a unique largest component of size ∼℘(ε)⋅2n⋅n\sim \wp(ε) \cdot 2^n\cdot n!$ a.s.. This "giant" component is furthermore dense in the reversal graph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.