Binary jumbled string matching for highly run-length compressible texts (Q2444848): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:08, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Binary jumbled string matching for highly run-length compressible texts |
scientific article |
Statements
Binary jumbled string matching for highly run-length compressible texts (English)
0 references
11 April 2014
0 references
string algorithm
0 references
data structures
0 references
jumbled pattern matching
0 references
Parikh vectors
0 references
prefix normal form
0 references
run-lenght encoding
0 references
