A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115)
From MaRDI portal
!
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 5021200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simpler and faster 1.5-approximation algorithm for sorting by transpositions |
scientific article; zbMATH DE number 5021200 |
Statements
A simpler and faster 1.5-approximation algorithm for sorting by transpositions (English)
0 references
28 April 2006
0 references
Computational biology
0 references
Genome rearrangements
0 references
Sorting permutations by transpositions
0 references
0 references
0.9801217913627625
0 references
0.874496579170227
0 references
0.8554969429969788
0 references
0.8553417325019836
0 references
0.8548319339752197
0 references
