Probability to realize string using subsequences

  • Context: MHB 
  • Thread starter Thread starter MonD1
  • Start date Start date
  • Tags Tags
    Probability String
Click For Summary

Discussion Overview

The discussion revolves around the probability of reconstructing an original string from a set of given subsequences. Participants explore the conditions under which this reconstruction is possible, including the number of subsequences required and their structural properties. The topic touches on theoretical aspects of probability and combinatorics.

Discussion Character

  • Exploratory
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant inquires about the probability of realizing the original string "MISSISSIPPI" using seven provided subsequences, questioning how many are needed for optimal probability and if there is a specific structure for these subsequences.
  • Another participant requests clarification on the initial approach or thoughts of the original poster to better assist in the discussion.
  • A subsequent reply reiterates the request for the original poster's thoughts and specifies the parameters of the problem, including the length of the original string and the subsequences.
  • One participant expresses confusion regarding the original question, noting discrepancies in the lengths of subsequences and questioning the meaning of "probability of getting the original string" from the subsequences.

Areas of Agreement / Disagreement

Participants do not appear to reach a consensus, as there are differing interpretations of the original question and the requirements for the subsequences. Some express confusion about the problem's formulation, indicating that multiple competing views remain.

Contextual Notes

There are limitations in the clarity of the problem statement, particularly regarding the definitions of subsequences and the conditions for reconstructing the original string. The discussion also highlights unresolved questions about the lengths of subsequences and their relationship to the original string.

Who May Find This Useful

This discussion may be of interest to individuals studying probability, combinatorics, or those working on problems related to string reconstruction and subsequence analysis.

MonD1
Messages
2
Reaction score
0
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?
 
Physics news on Phys.org
Re: probability to realize string using subsequences

Can you post what you have tried or what your thoughts are on how to begin? This will give our helpers a better idea how best to help you. :D
 
Re: probability to realize string using subsequences

MarkFL said:
Can you post what you have tried or what your thoughts are on how to begin? This will give our helpers a better idea how best to help you. :D

Input
string of length 'm'
'k' subsequences of the string each of length 'n' (n <m)

What is the probability that by using these subsequences we can come up with the original string?
 
i still don't understand the question. post #1 doesn't appear to have substrings of the same length as you required in post #3.

Its also not clear what you mean by probablility of "getting the original string" from your substrings.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 66 ·
3
Replies
66
Views
7K
  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 17 ·
Replies
17
Views
4K
Replies
4
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 9 ·
Replies
9
Views
5K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K