Efficient identification of \(k\)-closed strings (Q5859637)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient identification of k-closed strings |
scientific article; zbMATH DE number 7334815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient identification of \(k\)-closed strings |
scientific article; zbMATH DE number 7334815 |
Statements
Efficient Identification of k-Closed Strings (English)
0 references
19 April 2021
0 references
algorithms on strings
0 references
combinatorics on words
0 references
closed string
0 references
border
0 references
Hamming distance
0 references
0.7776120901107788
0 references
0.7525756359100342
0 references
0.7513713240623474
0 references
0.7426145076751709
0 references
0.7374396920204163
0 references
