Efficient merged longest common subsequence algorithms for similar sequences (Q1686075)
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: Efficient merged longest common subsequence algorithms for similar sequences |
scientific article; zbMATH DE number 6820624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient merged longest common subsequence algorithms for similar sequences |
scientific article; zbMATH DE number 6820624 |
Statements
Efficient merged longest common subsequence algorithms for similar sequences (English)
0 references
20 December 2017
0 references
longest common subsequence (LCS)
0 references
merged longest common subsequence (MLCS)
0 references
sequence similarity
0 references
0 references
0 references
0 references
0 references
0 references
0.9135865
0 references
0.9135865
0 references
0.9100298
0 references
0 references
0.90836334
0 references
0.9060373
0 references
0.9020418
0 references
