Algorithms for longest common abelian factors (Q2833540)
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 6654708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for longest common abelian factors |
scientific article; zbMATH DE number 6654708 |
Statements
18 November 2016
0 references
longest common factor
0 references
linear
0 references
algorithm
0 references
abelian properties
0 references
abelian match
0 references
Parikh vector
0 references
0 references
Algorithms for longest common abelian factors (English)
0 references
0.9013997316360474
0 references
0.8716939687728882
0 references
0.8535685539245605
0 references
0.805317759513855
0 references
