Window-accumulated subsequence matching problem is linear (Q5957906)
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 1719221
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Window-accumulated subsequence matching problem is linear |
scientific article; zbMATH DE number 1719221 |
Statements
Window-accumulated subsequence matching problem is linear (English)
0 references
27 November 2002
0 references
subsequence matching
0 references
0.8271194100379944
0 references
0.7990456819534302
0 references
0.7754589915275574
0 references
0.774431586265564
0 references
