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 the normal view instead:
scientific article; zbMATH DE number 5599214
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9212998151779176
0 references
0.8975985646247864
0 references
0.8951699733734131
0 references
0.8913831114768982
0 references
0.8797546625137329
0 references
