Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence (Q2904488): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q225410 / rank | |||
| Property / author | |||
| Property / author: Eduardo Sany Laber / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_12 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W73366147 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:13, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence |
scientific article |
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
