Binary jumbled string matching for highly run-length compressible texts (Q2444848): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On approximate jumbled pattern matching in strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Prefix Normal Words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Indexing permutations for binary strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sub-quadratic time and linear space data structures for permutation matching in binary strings / rank | |||
Normal rank | |||
Latest revision as of 15:15, 7 July 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
0 references
