A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hardness result and new algorithm for the longest common palindromic subsequence problem |
scientific article |
Statements
A hardness result and new algorithm for the longest common palindromic subsequence problem (English)
0 references
18 October 2017
0 references
string processing
0 references
palindromic subsequences
0 references
longest common subsequences
0 references
nesting rectangles
0 references
0 references
