A branch-and-cut algorithm for multiple sequence alignment (Q2583133)
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: A branch-and-cut algorithm for multiple sequence alignment |
scientific article; zbMATH DE number 2246758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for multiple sequence alignment |
scientific article; zbMATH DE number 2246758 |
Statements
A branch-and-cut algorithm for multiple sequence alignment (English)
0 references
13 January 2006
0 references
branch-and-cut approach
0 references
multiple sequence alignment problem
0 references
heuristic
0 references
0 references
0.9131387
0 references
0.9124533
0 references
0.9081504
0 references
0 references
