Algorithms and hardness for the longest common subsequence of three strings and related problems (Q6545446)
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: Algorithms and hardness for the longest common subsequence of three strings and related problems |
scientific article; zbMATH DE number 7854978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and hardness for the longest common subsequence of three strings and related problems |
scientific article; zbMATH DE number 7854978 |
Statements
Algorithms and hardness for the longest common subsequence of three strings and related problems (English)
0 references
29 May 2024
0 references
longest common subsequence
0 references
longest cubic subsequence
0 references
NP-completeness
0 references
polynomial-time algorithms
0 references
0.7948384881019592
0 references
0.7710451483726501
0 references
0.7702726721763611
0 references
0.7635961174964905
0 references
0.7506129145622253
0 references
