Efficient algorithms for finding a longest common increasing subsequence (Q996830)
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: Efficient algorithms for finding a longest common increasing subsequence |
scientific article; zbMATH DE number 5172684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for finding a longest common increasing subsequence |
scientific article; zbMATH DE number 5172684 |
Statements
Efficient algorithms for finding a longest common increasing subsequence (English)
0 references
19 July 2007
0 references
Design and analysis of algorithms
0 references
Longest common increasing subsequence
0 references
0.9954570531845092
0 references
0.9152601957321168
0 references
0.9129698872566224
0 references
0.8973427414894104
0 references
0.8797546625137329
0 references
