✦ LIBER ✦

Sorting signed permutations by reversals, revisited

✍ Scribed by Haim Kaplan; Elad Verbin

Book ID: 108166491
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 320 KB
Volume: 70
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.12.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Faster and Simpler Algorithm for Sorti

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

✍ Kaplan, Haim; Shamir, Ron; Tarjan, Robert E. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 321 KB

Sorting Unsigned Permutations by Weighte

Sorting Unsigned Permutations by Weighted Reversals, Transpositions, and Transreversals

✍ Xiao-Wen Lou; Da-Ming Zhu 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 503 KB

A new approximation algorithm for sortin

A new approximation algorithm for sorting of signed permutations

✍ Yong He; Ting Chen 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 576 KB

Sorting permutations by block-interchang

Sorting permutations by block-interchanges

✍ David A. Christie 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Various global rearrangements of permutations, such as reversals and transpositions have recently become of interest because of their applications in genome analysis. The study of such rearrangements leads to computational problems that are of interest in their own right. In this paper we introduce

Sorting Strings by Reversals and by Tran

Sorting Strings by Reversals and by Transpositions

✍ Christie, David A.; Irving, Robert W. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 169 KB

Sorting of Permutations by Cost-Constrai

Sorting of Permutations by Cost-Constrained Transpositions

✍ Farnoud, F.; Milenkovic, O. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 731 KB