A Linear-Time <i>n</i> <sup>0.4</sup> -Approximation for Longest Common Subsequence (Q6075744)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7753160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Linear-Time <i>n</i> <sup>0.4</sup> -Approximation for Longest Common Subsequence |
scientific article; zbMATH DE number 7753160 |
Statements
A Linear-Time <i>n</i> <sup>0.4</sup> -Approximation for Longest Common Subsequence (English)
0 references
23 October 2023
0 references
longest common subsequence
0 references
string algorithms
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
