✦ LIBER ✦

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

✍ Scribed by Kaplan, Haim; Shamir, Ron; Tarjan, Robert E.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simpler and faster 1.5-approximation a

✍ Tzvika Hartman; Ron Shamir 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 520 KB

A new approximation algorithm for sortin

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

A more efficient algorithm for perfect s

✍ Sèverine Bérard; Cedric Chauve; Christophe Paul 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Approximate String Matching: A Simpler F

✍ Cole, Richard; Hariharan, Ramesh 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 235 KB

A Faster and Simpler Recursive Algorithm

✍ Erik Elmroth; Fred G. Gustavson 📂 Article 📅 2001 🏛 Springer Netherlands 🌐 English ⚖ 183 KB

Sorting Strings by Reversals and by Tran

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