Faster algorithms for computing longest common increasing subsequences (Q655431): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jda.2011.03.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JDA.2011.03.013 / rank | |||
Normal rank | |||
Latest revision as of 00:01, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for computing longest common increasing subsequences |
scientific article |
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
