An almost-linear time and linear space algorithm for the longest common subsequence problem (Q1041737)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An almost-linear time and linear space algorithm for the longest common subsequence problem |
scientific article; zbMATH DE number 5642330
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An almost-linear time and linear space algorithm for the longest common subsequence problem |
scientific article; zbMATH DE number 5642330 |
Statements
An almost-linear time and linear space algorithm for the longest common subsequence problem (English)
0 references
4 December 2009
0 references
algorithms
0 references
primal-dual algorithm
0 references
longest common subsequence
0 references
0 references
