Stein's Method and Minimum Parsimony Distance after Shuffles

Details Stein's Method and Minimum Parsimony Distance after Shuffles Stein's Method and Minimum Parsimony Distance after Shuffles

2004-10-29

arxiv.org/abs/math/0410622v1

Mathematics

Probability

23 pages

Scientific paper

Motivated by Bourque and Pevzner's simulation study of the parsimony method for studying genome rearrangement, Berestycki and Durrett used techniques from random graph theory to prove that the minimum parsimony distance after iterating the random transposition shuffle undergoes a transition from Poisson to normal behavior. This paper establishes an analogous result for minimum parsimony distance after iterates of riffle shuffles or iterates of riffle shuffles and cuts. The analysis is elegant and uses different tools: Stein's method and generating functions. A useful technique which emerges is that of making a problem more tractable by adding extra symmetry, then using Stein's method to exploit the symmetry in the modified problem, and from this deducing information about the original problem.

Affiliated with

Also associated with

No associations

Rating

Stein's Method and Minimum Parsimony Distance after Shuffles 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 Stein's Method and Minimum Parsimony Distance after Shuffles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stein's Method and Minimum Parsimony Distance after Shuffles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-479958