Approximating the maximum consecutive subsums of a sequence (Q2437755)
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 6269527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the maximum consecutive subsums of a sequence |
scientific article; zbMATH DE number 6269527 |
Statements
Approximating the maximum consecutive subsums of a sequence (English)
0 references
13 March 2014
0 references
Parikh vectors
0 references
permutation pattern matching
0 references
approximate pattern matching
0 references
maximum subsequence sum
0 references
0.9155862
0 references
0 references
0.8873627
0 references
0.8830509
0 references
0 references
0.87769264
0 references
0.8754146
0 references
