Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635)
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 6329892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a longest common subsequence that is almost increasing on sequences having no repeated elements |
scientific article; zbMATH DE number 6329892 |
Statements
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (English)
0 references
13 August 2014
0 references
algorithms
0 references
longest common subsequence
0 references
longest increasing subsequence
0 references
longest almost increasing subsequence
0 references
0.8898367285728455
0 references
0.8296299576759338
0 references
0.8268189430236816
0 references
0.82417231798172
0 references
0.8208285570144653
0 references
