An efficient algorithm for one-sided block ordering problem under block-interchange distance (Q897897)
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: An efficient algorithm for one-sided block ordering problem under block-interchange distance |
scientific article; zbMATH DE number 6517446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for one-sided block ordering problem under block-interchange distance |
scientific article; zbMATH DE number 6517446 |
Statements
An efficient algorithm for one-sided block ordering problem under block-interchange distance (English)
0 references
8 December 2015
0 references
algorithm
0 references
computational biology
0 references
one-sided block ordering problem
0 references
block-interchange
0 references
0.9916730523109436
0 references
0.7736607789993286
0 references
0.7682288289070129
0 references
0.7500327229499817
0 references
