A simpler and faster 1.5-approximation algorithm for sorting by transpositions (Q2490115): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ic.2005.09.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047742824 / rank | |||
Normal rank | |||
Revision as of 19:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simpler and faster 1.5-approximation algorithm for sorting by transpositions |
scientific article |
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
