New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774)
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: New tabulation and sparse dynamic programming based techniques for sequence similarity problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New tabulation and sparse dynamic programming based techniques for sequence similarity problems |
scientific article |
Statements
New tabulation and sparse dynamic programming based techniques for sequence similarity problems (English)
0 references
12 September 2016
0 references
sequence similarity
0 references
longest common subsequence
0 references
sparse dynamic programming
0 references
tabulation
0 references
0.832394003868103
0 references
0.8318260908126831
0 references
0.8315768241882324
0 references
0.8311413526535034
0 references
0.8254326581954956
0 references
