Complexity insights of the minimum duplication problem (Q2440167)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6275057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity insights of the minimum duplication problem |
scientific article; zbMATH DE number 6275057 |
Statements
Complexity insights of the minimum duplication problem (English)
0 references
27 March 2014
0 references
minimum duplication problem
0 references
comparative genomics
0 references
computational complexity
0 references
APX-hardness
0 references
randomized algorithm
0 references
0 references
0 references
0.9957924485206604
0 references
0.848793625831604
0 references
0.8225409388542175
0 references
0.8102922439575195
0 references
