Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488)
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 6065599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence |
scientific article; zbMATH DE number 6065599 |
Statements
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (English)
0 references
14 August 2012
0 references
Parikh vectors
0 references
maximum subsequence sum
0 references
approximate pattern matching
0 references
approximation algorithms
0 references
0.9155862
0 references
0.8703425
0 references
0.86835647
0 references
0.8662642
0 references
0.85413325
0 references
0.8539079
0 references
0.8508209
0 references
0.85029656
0 references
