| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952273 | Theoretical Computer Science | 2017 | 15 Pages |
Abstract
Furthermore, we use log-lists to implement several existing algorithms for sorting permutations by transpositions and/or reversals and/or block-interchanges, and obtain O(nlogâ¡n) running time for all of them. In this way, the running time of several algorithms is improved, whereas in other cases our algorithms perform as well as the best existing implementations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Irena Rusu,