| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428790 | Information Processing Letters | 2008 | 6 Pages |
Abstract
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum prime degree d of the strong interval tree, i.e., f(d).nO(1). This improves the best known algorithm which complexity was based on a parameter always larger than or equal to d.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
