An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An A^ search algorithm for the constrained longest common subsequence problem |
scientific article; zbMATH DE number 7306063
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(A^\ast\) search algorithm for the constrained longest common subsequence problem |
scientific article; zbMATH DE number 7306063 |
Statements
An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (English)
0 references
4 February 2021
0 references
longest common subsequences
0 references
constrained sequences
0 references
\(A^\ast\) search
0 references
combinatorial problems
0 references
0.8549858927726746
0 references
0.8444947600364685
0 references
0.8297168612480164
0 references
0.8250023722648621
0 references
