A fast algorithm for computing a longest common increasing subsequence (Q835045)
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: A fast algorithm for computing a longest common increasing subsequence |
scientific article; zbMATH DE number 5599214
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for computing a longest common increasing subsequence |
scientific article; zbMATH DE number 5599214 |
Statements
A fast algorithm for computing a longest common increasing subsequence (English)
0 references
27 August 2009
0 references
algorithms
0 references
computational biology
0 references
longest common subsequence
0 references
longest increasing subsequence
0 references
