The longest commonly positioned increasing subsequences problem (Q1702817)
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 6845566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The longest commonly positioned increasing subsequences problem |
scientific article; zbMATH DE number 6845566 |
Statements
The longest commonly positioned increasing subsequences problem (English)
0 references
1 March 2018
0 references
longest increasing subsequence
0 references
common positions
0 references
algorithms
0 references
dual relationship
0 references
longest common increasing subsequence
0 references
0.8563392758369446
0 references
0.852467954158783
0 references
0.8492071628570557
0 references
0.8449177145957947
0 references
0.8250594735145569
0 references
