Loading...
Please wait, while we are loading the content...
Similar Documents
A more efficient algorithm for perfect sorting by reversals (2008).
| Content Provider | CiteSeerX |
|---|---|
| Author | Bérard, Sèverine Chauve, Cedric Paul, Christophe |
| 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).n O(1). This improves the best known algorithm which complexity was based on a parameter always larger than or equal to d. |
| File Format | |
| Publisher Date | 2008-01-01 |
| Access Restriction | Open |
| Subject Keyword | Perfect Sorting Efficient Algorithm Strong Interval Tree Worst-case Time Complexity New Algorithm Maximum Prime Degree |
| Content Type | Text |