Sorting by Prefix Reversal (or Flipping Pancakes) approximation
Does anyone know how to prove that the Sorting by Prefix Reversal (or Flipping Pancakes) is a 3 as well as a 4-approximation?
• 1,621 views
•
link
updated
by
Ram
•
written
by
Gustavo Temple •
•
written
by
Gustavo Temple •
0 answers
No answers yet.
Log in to answer this question.
More posts like this
-
Why 99% coverage at 20X depth for sequencing?
written by aussie_roo •
-
Storing TCGA data in an encrypted way
written by Hashirama •
-
Where can I download GO terms and their associated E. coli genes?
written by O.rka
-
coordinate-sorted versus name-sorted bam file
written by bnayer26 •
-
RIP-Seq data analysis
written by flyguymail22 •
-
Tools to calculate directionality index
written by h.long •
-
edgeR again: can you AND multiple conditions for analysis?
written by moxu
-
Adding gene diagram to output from snp.plotter
written by LauferVA
-
How to filter alignment columns that have less than a minimum number of species?
written by RoryC •
-
Forum: Is Bioinformatics a creative field/industry?
written by 14134125465346445
Could you please give us some information on how this is related to bioinformatics? Thank you!
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.
A longer excerpt would give us better context.