A specialized branching and fathoming technique for the longest common subsequence problem (Q3517653)
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 5310471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A specialized branching and fathoming technique for the longest common subsequence problem |
scientific article; zbMATH DE number 5310471 |
Statements
12 August 2008
0 references
longest common subsequence
0 references
branch and bound
0 references
dynamic programming
0 references
0.8408984541893005
0 references
0.8223490715026855
0 references
0.8067479133605957
0 references
0.8040958642959595
0 references
0.8020898699760437
0 references
