Computing equality-free and repetitive string factorisations (Q2634669): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2238855891 / rank | |||
Normal rank | |||
Revision as of 23:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing equality-free and repetitive string factorisations |
scientific article |
Statements
Computing equality-free and repetitive string factorisations (English)
0 references
18 February 2016
0 references
string factorisations
0 references
NP-hard string problems
0 references
parameterised complexity
0 references
multivariate algorithmics
0 references
