Computing a longest common almost-increasing subsequence of two sequences (Q2220858)
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 7300941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a longest common almost-increasing subsequence of two sequences |
scientific article; zbMATH DE number 7300941 |
Statements
Computing a longest common almost-increasing subsequence of two sequences (English)
0 references
25 January 2021
0 references
dynamic programming
0 references
longest common almost-increasing subsequence
0 references
0 references
0.8898367285728455
0 references
0.8460074067115784
0 references
0.8168432712554932
0 references
0.810989260673523
0 references
0.8078843355178833
0 references
