Efficient all path score computations on grid graphs (Q2437757)
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: Efficient all path score computations on grid graphs |
scientific article; zbMATH DE number 6269528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient all path score computations on grid graphs |
scientific article; zbMATH DE number 6269528 |
Statements
Efficient all path score computations on grid graphs (English)
0 references
13 March 2014
0 references
sequence alignment
0 references
all path score computations
0 references
0 references
0.9987099170684814
0 references
0.7754075527191162
0 references
0.7432030439376831
0 references
0.6950347423553467
0 references
