A linear space algorithm for computing a longest common increasing subsequence (Q845723): 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.ipl.2006.05.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983269319 / rank | |||
Normal rank | |||
Revision as of 00:26, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear space algorithm for computing a longest common increasing subsequence |
scientific article |
Statements
A linear space algorithm for computing a longest common increasing subsequence (English)
0 references
29 January 2010
0 references
algorithms
0 references
longest common subsequence
0 references
longest increasing subsequence
0 references
