New refinement techniques for longest common subsequence algorithms. (Q5897140)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5668087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New refinement techniques for longest common subsequence algorithms. |
scientific article; zbMATH DE number 5668087 |
Statements
String Processing and Information Retrieval (English)
0 references
9 February 2010
0 references
longest common subsequence
0 references
string algorithms
0 references
heuristic algorithms
0 references
0.8478350043296814
0 references
0.8356888890266418
0 references
0.8168955445289612
0 references
0.8127536177635193
0 references
