An information-theoretic lower bound for the longest common subsequence problem (Q1241422): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093513138 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear space algorithm for computing maximal common subsequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for computing longest common subsequences / rank | |||
Normal rank | |||
Latest revision as of 22:17, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An information-theoretic lower bound for the longest common subsequence problem |
scientific article |
Statements
An information-theoretic lower bound for the longest common subsequence problem (English)
0 references
1978
0 references
