Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving longest common subsequence problems via a transformation to the maximum clique problem |
scientific article |
Statements
Solving longest common subsequence problems via a transformation to the maximum clique problem (English)
0 references
20 April 2021
0 references
longest common subsequence
0 references
transformation to maximum clique
0 references
exact and heuristic solvers
0 references
0 references
0 references
0 references
