Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472)
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: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement |
scientific article; zbMATH DE number 819150
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement |
scientific article; zbMATH DE number 819150 |
Statements
Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (English)
0 references
11 January 1996
0 references
experimental analysis of algorithms
0 references
edit distance
0 references
sorting by reversals
0 references
genome rearrangements
0 references
chromosome inversions
0 references
shortest series of reversals
0 references
greedy approximation algorithm
0 references
branch-and-bound exact algorithm
0 references
maximum-weight matchings
0 references
shortest paths
0 references
linear programming
0 references
random permutations
0 references
random reversals
0 references
mitochondrial genomes
0 references
0.95641863
0 references
0 references
0.91390705
0 references
0.90597457
0 references
0.89070857
0 references
