A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem (Q4582900)
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: A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem |
scientific article; zbMATH DE number 6925190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cover-merging-based algorithm for the longest increasing subsequence in a sliding window problem |
scientific article; zbMATH DE number 6925190 |
Statements
24 August 2018
0 references
longest increasing subsequence
0 references
sliding window
0 references
pattern matching
0 references
0.84626305103302
0 references
0.8325345516204834
0 references
0.8303680419921875
0 references
0.8151993751525879
0 references
0.805192768573761
0 references
