On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794)
From MaRDI portal
scientific article; zbMATH DE number 7525488
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hardness and Inapproximability of Recognizing Wheeler Graphs |
scientific article; zbMATH DE number 7525488 |
Statements
11 May 2022
0 references
Burrows-Wheeler transform
0 references
string algorithms
0 references
suffix trees
0 references
NP-completeness
0 references
0 references
0 references
On the Hardness and Inapproximability of Recognizing Wheeler Graphs (English)
0 references
