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...
I tiakina i:
| Ngā kaituhi matua: | , , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Discrete Mathematics & Theoretical Computer Science
2018-06-01
|
| Rangatū: | Discrete Mathematics & Theoretical Computer Science |
| Ngā marau: | |
| Urunga tuihono: | https://dmtcs.episciences.org/3287/pdf |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|