Carregant...
Asymptotic Analysis of the kth Subword Complexity
Patterns within strings enable us to extract vital information regarding a string’s randomness. Understanding whether a string is random (Showing no to little repetition in patterns) or periodic (showing repetitions in patterns) are described by a value that is called the kth Subword Complexity of t...
Guardat en:
| Publicat a: | Entropy (Basel) |
|---|---|
| Autors principals: | , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
MDPI
2020
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7516637/ https://ncbi.nlm.nih.gov/pubmed/33285983 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/e22020207 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|