New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C90 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6626374 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sequence similarity | |||
| Property / zbMATH Keywords: sequence similarity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
longest common subsequence | |||
| Property / zbMATH Keywords: longest common subsequence / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
sparse dynamic programming | |||
| Property / zbMATH Keywords: sparse dynamic programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
tabulation | |||
| Property / zbMATH Keywords: tabulation / rank | |||
Normal rank | |||
Revision as of 00:32, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
