Cargando…
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...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7516637/ https://www.ncbi.nlm.nih.gov/pubmed/33285983 http://dx.doi.org/10.3390/e22020207 |
Ejemplares similares
Cargando…
Enhancing Subword Embeddings with Open N-grams
por: Veres, Csaba, et al.
Publicado: (2020)
por: Veres, Csaba, et al.
Publicado: (2020)