Beam search for the longest common subsequence problem (Q833536)
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: Beam search for the longest common subsequence problem |
scientific article; zbMATH DE number 5595290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beam search for the longest common subsequence problem |
scientific article; zbMATH DE number 5595290 |
Statements
Beam search for the longest common subsequence problem (English)
0 references
14 August 2009
0 references
beam search
0 references
longest common subsequence problem
0 references
0 references
0 references
0 references
0 references
0.9275301098823548
0 references
0.8459885120391846
0 references
0.8442392945289612
0 references
0.8245010375976562
0 references
