Anytime algorithms for the longest common palindromic subsequence problem (Q2337390): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127023015, #quickstatements; #temporary_batch_1722545624460 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127023015 / rank | |||
Normal rank | |||
Latest revision as of 22:56, 1 August 2024
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
