Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
When considering binary strings, it's natural to wonder how many distinct subsequences might exist in a given string. Given that there is an existing algorithm which provides a straightforward way to compute the number of distinct subsequences in a fixed string, we might next be interested in the ex...
Tallennettuna:
| Päätekijät: | , , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
Discrete Mathematics & Theoretical Computer Science
2018-06-01
|
| Sarja: | Discrete Mathematics & Theoretical Computer Science |
| Aiheet: | |
| Linkit: | https://dmtcs.episciences.org/3287/pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|