A fast algorithm for the longest-common-subsequence problem (Q1155365): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0255(80)90025-0 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026097868 / rank | |||
Revision as of 08:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for the longest-common-subsequence problem |
scientific article |
Statements
A fast algorithm for the longest-common-subsequence problem (English)
0 references
1980
0 references
