Timeline for Calculating the probability that all possible length $r$ subwords exists in a string, with or without overlaps allowed
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2014 at 7:28 | comment | added | AClockTicks | Let's scratch (2) because its too hard. But for (1) I was hoping for either an exact expression OR some approximate expression that works well for strings with $L \geq 10$ and $q \geq 2$ or so. I'm less interested in asymptotics, but that's not to say I didn't appreciate the paper. | |
| Apr 7, 2014 at 7:21 | comment | added | Bjørn Kjos-Hanssen | Yes. But do you need an exact expression or just some asymptotics? | |
| Apr 7, 2014 at 7:13 | comment | added | AClockTicks | From the paper (researchgate.net/publication/…) I don't think there's going to be a reasonable analytic expression for the exact probability for (1). Scenario (2) seems hopeless. Do you agree with this? | |
| Apr 7, 2014 at 6:46 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |