Computing the longest common almost-increasing subsequence (Q2166775)
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 7575105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the longest common almost-increasing subsequence |
scientific article; zbMATH DE number 7575105 |
Statements
Computing the longest common almost-increasing subsequence (English)
0 references
25 August 2022
0 references
algorithms
0 references
longest common subsequence
0 references
longest increasing subsequence
0 references
0 references
0 references
0 references
0 references
0.8956851363182068
0 references
0.8786950707435608
0 references
0.8384937047958374
0 references
0.8377169966697693
0 references
0.8340452313423157
0 references
