Given a input string and 'n' random subsequences of that string , what is the probability of realizing original string using these subsequences correctly?
Given string = "MISSISSIPPI"
6 ) "SP"
How many subsequences will be required for optimal probability?
Is there any specific structure for subsequences for optimal probability?
Some questions about your question. With your sub sequences how would you ever get SIP?
What do you mean by optimal probability?
In mathematics, you don't understand things. You just get used to them.
Of course that result can be rigorously obtained, but who cares?
Combinatorics is Algebra and Algebra is Combinatorics.