Binary jumbled string matching for highly run-length compressible texts (Q2444848)
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 6282899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary jumbled string matching for highly run-length compressible texts |
scientific article; zbMATH DE number 6282899 |
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
0 references
0.91962373
0 references
0.90869826
0 references
0.8900358
0 references
0 references
0.8892702
0 references
0 references
0.88325506
0 references
