Comparing incomplete sequences via longest common subsequence (Q2333802)
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: Comparing incomplete sequences via longest common subsequence |
scientific article; zbMATH DE number 7129478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing incomplete sequences via longest common subsequence |
scientific article; zbMATH DE number 7129478 |
Statements
Comparing incomplete sequences via longest common subsequence (English)
0 references
13 November 2019
0 references
longest common subsequence
0 references
string algorithms
0 references
approximation algorithms
0 references
computational complexity
0 references
fixed-parameter algorithms
0 references
0 references
0.9573535919189452
0 references
0.8044471144676208
0 references
0.7912164330482483
0 references
0.784160852432251
0 references
0.7767956256866455
0 references
