Anytime algorithms for the longest common palindromic subsequence problem (Q2337390)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Anytime algorithms for the longest common palindromic subsequence problem |
scientific article |
Statements
Anytime algorithms for the longest common palindromic subsequence problem (English)
0 references
19 November 2019
0 references
longest common palindromic subsequence problem
0 references
anytime algorithms
0 references
A* search
0 references
beam search
0 references
hybrid algorithms
0 references
0 references
0 references
0 references
0 references
