Faster algorithms for computing longest common increasing subsequences (Q655431)
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: Faster algorithms for computing longest common increasing subsequences |
scientific article; zbMATH DE number 5994303
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for computing longest common increasing subsequences |
scientific article; zbMATH DE number 5994303 |
Statements
Faster algorithms for computing longest common increasing subsequences (English)
0 references
4 January 2012
0 references
common subsequences
0 references
increasing subsequences
0 references
small alphabets
0 references
Van Emde Boas trees
0 references
0 references
0.9988725781440736
0 references
0.9211660623550416
0 references
0.9152601957321168
0 references
0.8975985646247864
0 references
0.8819800019264221
0 references
