A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates (Q1708439)
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 linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates |
scientific article; zbMATH DE number 6852365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates |
scientific article; zbMATH DE number 6852365 |
Statements
A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates (English)
0 references
23 March 2018
0 references
DCJ distance
0 references
duplicates
0 references
double cut and join operation
0 references
0.8352173566818237
0 references
0.8256019353866577
0 references
0.8185327649116516
0 references
0.8167270421981812
0 references
