Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast algorithms for single and multiple pattern Cartesian tree matching |
scientific article; zbMATH DE number 7285596
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for single and multiple pattern Cartesian tree matching |
scientific article; zbMATH DE number 7285596 |
Statements
Fast algorithms for single and multiple pattern Cartesian tree matching (English)
0 references
15 December 2020
0 references
Cartesian tree matching
0 references
prefix-parent representation
0 references
prefix-child representation
0 references
global-parent representation
0 references
fingerprinting methods
0 references
0 references
0.8833698034286499
0 references
0.8423784971237183
0 references
0.758669912815094
0 references
0.7584662437438965
0 references
0.7492287755012512
0 references
