Faster algorithms for computing longest common increasing subsequences (Q655431): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2011.03.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2131441444 / rank | |||
Normal rank | |||
Revision as of 20:13, 19 March 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
