An efficient algorithm for the longest common palindromic subsequence problem (Q2672607)
From MaRDI portal
!
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 7540224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the longest common palindromic subsequence problem |
scientific article; zbMATH DE number 7540224 |
Statements
An efficient algorithm for the longest common palindromic subsequence problem (English)
0 references
13 June 2022
0 references
longest common subsequence
0 references
longest common palindromic subsequence
0 references
diagonal method
0 references
3-D domination
0 references
0 references
0 references
0.8914626836776733
0 references
0.8846806287765503
0 references
0.8560625910758972
0 references
0.8284434080123901
0 references
0.8145994544029236
0 references
