2015
DOI: 10.1016/j.jda.2015.03.007
|View full text |Cite
|
Sign up to set email alerts
|

Pancake flipping and sorting permutations

Abstract: In this paper, we study several variations of the pancake flipping problem, which is also well known as the problem of sorting by prefix reversals. We consider the variations in the sorting process by adding with prefix reversals other similar operations such as prefix transpositions and prefix transreversals. We first study the problem of sorting unsigned permutations by prefix reversals and prefix transpositions and present a 3-approximation algorithm for this problem. Then we give a 2-approximation algorith… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
1
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 29 publications
(33 reference statements)
0
1
0
Order By: Relevance
“…In turn, this enabled a consistent comparison between themes to be observed effectively (Wald, 2014), thus increasing validity by incorporating several viewpoints. Therefore, combining multiple methods reduced the potential for intrinsic bias, and influence of preexisting patterns and trends (Yeasmin, & Rahman, 2012).…”
Section: Methodsmentioning
confidence: 99%
“…In turn, this enabled a consistent comparison between themes to be observed effectively (Wald, 2014), thus increasing validity by incorporating several viewpoints. Therefore, combining multiple methods reduced the potential for intrinsic bias, and influence of preexisting patterns and trends (Yeasmin, & Rahman, 2012).…”
Section: Methodsmentioning
confidence: 99%
“…There are several genome rearrangement events such as reversal, transposition, block-interchanges, etc. [4,10,5,9] that contribute much to such biological diversity. In this paper, we will only discuss block-interchanges and its variations.…”
Section: Introductionmentioning
confidence: 99%
“…Hasan et al [39] considered Sorting by Prefix Reversals and Transpositions (SbPRT), in which prefix reversals and prefix transpositions are allowed simultaneously, and gave a 3approximation algorithm with no considerations regarding the diameter. They also considered Sorting by Prefix Reversals and Prefix Transreversals, presenting a 2-approximation algorithm for it.…”
Section: Chapter 3 Known Results For Traditional Approachmentioning
confidence: 99%
“…For SbPRT, let [39] because b upr (π prt n ) = n − 1 when n is even and ⌈(n − 1)/2⌉ = ⌈n/2⌉, and b upr (π prt n ) = n when n is odd. Now we show that Algorithm 8 sorts π prt n with ⌈n/2⌉ + 1 rearrangements.…”
Section: Sort_family_sbpsr(π N)mentioning
confidence: 99%