A new efficient algorithm for computing the longest common subsequence (Q733720)
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: A new efficient algorithm for computing the longest common subsequence |
scientific article; zbMATH DE number 5617702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new efficient algorithm for computing the longest common subsequence |
scientific article; zbMATH DE number 5617702 |
Statements
A new efficient algorithm for computing the longest common subsequence (English)
0 references
19 October 2009
0 references
longest common subsequence
0 references
algorithms
0 references
strings
0 references
0.9680285453796388
0 references
0.8817663788795471
0 references
0.8725955486297607
0 references
0.8665575981140137
0 references
0.8657407760620117
0 references
