On finding a longest common palindromic subsequence (Q1698702)
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 6839794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding a longest common palindromic subsequence |
scientific article; zbMATH DE number 6839794 |
Statements
On finding a longest common palindromic subsequence (English)
0 references
16 February 2018
0 references
string algorithm
0 references
longest common palindromic subsequence
0 references
0.8804724216461182
0 references
0.8489006161689758
0 references
0.8235107064247131
0 references
0.8197859525680542
0 references
0.8119421005249023
0 references
