An improved algorithm for the longest common subsequence problem (Q1762001)
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 6107484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved algorithm for the longest common subsequence problem |
scientific article; zbMATH DE number 6107484 |
Statements
An improved algorithm for the longest common subsequence problem (English)
0 references
15 November 2012
0 references
longest common subsequence
0 references
LCS
0 references
beam search
0 references
heuristic function
0 references
algorithms
0 references
bioinformatics
0 references
0 references
0 references
0 references
0.8953522443771362
0 references
0.8459885120391846
0 references
0.8322751522064209
0 references
0.8168303966522217
0 references
