Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635): 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.2012.12.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1999879627 / rank | |||
Normal rank | |||
Revision as of 01:23, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a longest common subsequence that is almost increasing on sequences having no repeated elements |
scientific article |
Statements
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (English)
0 references
13 August 2014
0 references
algorithms
0 references
longest common subsequence
0 references
longest increasing subsequence
0 references
longest almost increasing subsequence
0 references
