On the complexity of recognizing Wheeler graphs (Q2118211)
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 7495496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of recognizing Wheeler graphs |
scientific article; zbMATH DE number 7495496 |
Statements
On the complexity of recognizing Wheeler graphs (English)
0 references
22 March 2022
0 references
Wheeler graphs
0 references
FM-index
0 references
Burrows-Wheeler transform
0 references
0 references
0.8259668946266174
0 references
0.8213425278663635
0 references
0.7484018802642822
0 references
0.710838258266449
0 references
