Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916)
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 7559193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-Linear-Time Algorithm for Longest Common Circular Factor |
scientific article; zbMATH DE number 7559193 |
Statements
18 July 2022
0 references
longest common factor
0 references
circular pattern matching
0 references
internal pattern matching
0 references
intersection of hyperrectangles
0 references
0 references
Quasi-Linear-Time Algorithm for Longest Common Circular Factor (English)
0 references
0.89057034
0 references
0.8841932
0 references
0.8799355
0 references
0.8763958
0 references
0.8763958
0 references
0.8429024
0 references
