The distribution of cycles in breakpoint graphs of signed permutations

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Breakpoint graphs are ubiquitous structures in the field of genome rearrangements. Their cycle decomposition has proved useful in computing and bounding many measures of (dis)similarity between genomes, and studying the distribution of those cycles is therefore critical to gaining insight on the distributions of the genomic distances that rely on it. We extend here the work initiated by Doignon and Labarre, who enumerated unsigned permutations whose breakpoint graph contains $k$ cycles, to signed permutations, and prove explicit formulas for computing the expected value and the variance of the corresponding distributions, both in the unsigned case and in the signed case. We also compare these distributions to those of several well-studied distances, emphasising the cases where approximations obtained in this way stand out. Finally, we show how our results can be used to derive simpler proofs of other previously known results.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The distribution of cycles in breakpoint graphs of signed permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The distribution of cycles in breakpoint graphs of signed permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The distribution of cycles in breakpoint graphs of signed permutations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-71135

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.