✦ LIBER ✦

A simpler and faster 1.5-approximation algorithm for sorting by transpositions

✍ Scribed by Tzvika Hartman; Ron Shamir

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A 1.5-approximation algorithm for sortin

✍ Tzvika Hartman; Roded Sharan 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A Faster and Simpler Algorithm for Sorti

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

Sorting by Transpositions

✍ Bafna, Vineet; Pevzner, Pavel A. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 424 KB

Approximate String Matching: A Simpler F

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

A 2-approximation algorithm for genome r

✍ Qian-Ping Gu; Shietung Peng; Hal Sudborough 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 885 KB

A Faster and Simpler Recursive Algorithm

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