Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

IPL
2008

favoriteEmaildiscussreport

86views more IPL 2008»

A more efficient algorithm for perfect sorting by reversals

13 years 4 months ago

A more efficient algorithm for perfect sorting by reversals

Download www.cecm.sfu.ca

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.

Sèverine Bérard, Cedric Chauve, Chri

Real-time Traffic

Algorithm | IPL 2008 | Maximum Prime Degree | Worst-case Time Complexity |

claim paper

Related Content

» AverageCase Analysis of Perfect Sorting by Reversals

» Perfect Sorting by Reversals Is Not Always Difficult

» Perfect Sorting by Reversals

» Sorting by Reciprocal Translocations via Reversals Theory

» Improving the Efficiency of Sorting by Reversals

» Sorting by Translocations Via Reversals Theory

» Efficient TrieBased Sorting of Large Sets of Strings

» The Problem of Chromosome Reincorporation in DCJ Sorting and Halving

» An Interruptible Algorithm for Perfect Sampling via Markov Chains

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Sèverine Bérard, Cedric Chauve, Christophe Paul

Comments (0)