Probabilistic Beam Search for the Longest Common Subsequence Problem (Q5429296)
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 5216173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic Beam Search for the Longest Common Subsequence Problem |
scientific article; zbMATH DE number 5216173 |
Statements
Probabilistic Beam Search for the Longest Common Subsequence Problem (English)
0 references
29 November 2007
0 references
0.9275301098823548
0 references
0.8168303966522217
0 references
0.8062946796417236
0 references
0.8037716746330261
0 references
0.797427237033844
0 references
