Optimal algorithms for uncovering synteny problem (Q2385477)
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: Optimal algorithms for uncovering synteny problem |
scientific article; zbMATH DE number 5200361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for uncovering synteny problem |
scientific article; zbMATH DE number 5200361 |
Statements
Optimal algorithms for uncovering synteny problem (English)
0 references
12 October 2007
0 references
Syntenic distance
0 references
Uncovering synteny
0 references
Optimal algorithm
0 references
0 references
0.8505914807319641
0 references
0.8429350852966309
0 references
0.8132585883140564
0 references
