On computing all suboptimal alignments (Q1291563)
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: On computing all suboptimal alignments |
scientific article; zbMATH DE number 1299796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing all suboptimal alignments |
scientific article; zbMATH DE number 1299796 |
Statements
On computing all suboptimal alignments (English)
0 references
20 September 2000
0 references
divide-and-conquer
0 references
linear-space algorithm
0 references
sequence comparison
0 references
suboptimal alignments
0 references
minimal directed acyclic graph
0 references
0 references
0.88397527
0 references
0.8791425
0 references
0.8718766
0 references
0.8699246
0 references
0.8649826
0 references
0.8645019
0 references
0.8644919
0 references
