You are not logged in.

- Topics: Active | Unanswered

Pages: **1**

**MonD****Member**- Registered: 2014-02-02
- Posts: 1

Given a input string and 'n' random subsequences of that string , what is the probability of realizing original string using these subsequences correctly?

Example :

Given string = "MISSISSIPPI"

Subsequences:

1) "MISS"

2) "III"

3) "MIP"

4) "SIS"

5) "IS"

6 ) "SP"

7) "MP"

How many subsequences will be required for optimal probability?

Is there any specific structure for subsequences for optimal probability?

Offline

**bobbym****Administrator**- From: Bumpkinland
- Registered: 2009-04-12
- Posts: 95,940

Hi MonD;

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.**

**If it ain't broke, fix it until it is.**

Offline

Pages: **1**