Sorting by Prefix Reversal (or Flipping Pancakes) approximation
0
0
Entering edit mode
5.7 years ago

Does anyone know how to prove that the Sorting by Prefix Reversal (or Flipping Pancakes) is a 3 as well as a 4-approximation?

algorithms • 1.1k views
ADD COMMENT
0
Entering edit mode

Could you please give us some information on how this is related to bioinformatics? Thank you!

ADD REPLY
0
Entering edit mode

Yes, I am a beginner and I am reading the book "An Introduction to Bioinformatics Algorithms", in the session about Genome Rearrangements there is a short explanation about the algorithm, but nothing about how to prove that it is a 3 as well as a 4-approximation.

ADD REPLY
0
Entering edit mode

A longer excerpt would give us better context.

ADD REPLY

Login before adding your answer.

Traffic: 2172 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6