The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791)
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: The substring inclusion constraint longest common subsequence problem can be solved in quadratic time |
scientific article; zbMATH DE number 6180268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The substring inclusion constraint longest common subsequence problem can be solved in quadratic time |
scientific article; zbMATH DE number 6180268 |
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
0.90537375
0 references
0.8998199
0 references
0.8980203
0 references
0.8968191
0 references
0.89155126
0 references
0.8901801
0 references
0.88897324
0 references
0.8875731
0 references
0.8872188
0 references
