Sub-quadratic time and linear space data structures for permutation matching in binary strings (Q414411): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Pattern matching for permutations / 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: ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding pattern matchings for permutations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Indexing permutations for binary strings / rank | |||
Normal rank | |||
Latest revision as of 04:06, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sub-quadratic time and linear space data structures for permutation matching in binary strings |
scientific article |
Statements
Sub-quadratic time and linear space data structures for permutation matching in binary strings (English)
0 references
11 May 2012
0 references
data structures
0 references
algorithms
0 references
pattern matching
0 references
permutation matching
0 references
