A further improved approximation algorithm for breakpoint graph decomposition (Q1768609)
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 further improved approximation algorithm for breakpoint graph decomposition |
scientific article; zbMATH DE number 2146085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A further improved approximation algorithm for breakpoint graph decomposition |
scientific article; zbMATH DE number 2146085 |
Statements
A further improved approximation algorithm for breakpoint graph decomposition (English)
0 references
15 March 2005
0 references
genome rearrangement
0 references
sorting by reversals
0 references
breakpoint graph
0 references
alternating cycle decomposition
0 references
maximum independent set
0 references
\(k\)-set packing
0 references
approximation algorithm
0 references
0.9259032607078552
0 references
0.9259032607078552
0 references
0.7907113432884216
0 references
