A more efficient algorithm for perfect sorting by reversals

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.

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Sèverine Bérard, Cedric Chauve, Christophe Paul
• Keywords: Algorithm, IPL 2008, Maximum Prime Degree, Worst-case Time Complexity