Locally maximal common factors as a tool for efficient dynamic string algorithms (Q5140774)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7286737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Locally maximal common factors as a tool for efficient dynamic string algorithms |
scientific article; zbMATH DE number 7286737 |
Statements
16 December 2020
0 references
dynamic algorithms
0 references
periodicity
0 references
longest common factor
0 references
priority queue data structures
0 references
suffix
0 references
0 references
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. (English)
0 references
0.8171936273574829
0 references
0.8132113814353943
0 references
0.7825883030891418
0 references
0.7731227278709412
0 references
0.7714415788650513
0 references
