Average-case analysis of perfect sorting by reversals

Details Average-case analysis of perfect sorting by reversals Average-case analysis of perfect sorting by reversals

2009-01-19

arxiv.org/abs/0901.2847v1

CPM'09, Lille : France (2009)

Mathematics

Combinatorics

Scientific paper

A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show that, despite this worst-case analysis, with probability one, sorting can be done in polynomial time. Further, we find asymptotic expressions for the average length and number of reversals in commuting permutations, an interesting sub-class of signed permutations.

Affiliated with

Also associated with

No associations

Rating

Average-case analysis of perfect sorting by reversals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Average-case analysis of perfect sorting by reversals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average-case analysis of perfect sorting by reversals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-566735