The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The substring inclusion constraint longest common subsequence problem can be solved in quadratic time |
scientific article |
Statements
The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (English)
0 references
24 June 2013
0 references
longest common subsequence
0 references
dynamic programming
0 references
