Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.stat.math.independent

Topic: longest ascending sequence
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
Malcolm McLean

Posts: 62
Registered: 2/7/10
longest ascending sequence
Posted: Mar 4, 2013 5:21 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

We've got a permutation of the integers 1 .. N.

So if we have an ascending sequence of N, the numbers must all be in rank order, and the probability is 1/N!. Similarly if the longest ascending sequence is 1, the numbers must be in exact reverse order, so the probability is similarly 1/N!.

It follow that for a sequence of three the probabilities are 1/3!, 4/3! and 1/3!.

But how do I solve it for the general case, given a sequence of N, what the probability of a maximum ascending sequence of m?

(In case you're wondering, I need this for a gene synteny problem. Sequences of DNA match each other, and generally the order is preserved, but you also have some out of sequence matches, which might be false positives or translocations. So how many in-sequence matches do I need to declare significance?)



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.