✦ LIBER ✦

Faster algorithms for sorting by transpositions and sorting by block interchanges

✍ Scribed by Feng, Jianxing; Zhu, Daming

Book ID: 121254497
Publisher: Association for Computing Machinery
Year: 2007
Tongue: English
Weight: 195 KB
Volume: 3
Category: Article
ISSN: 1549-6325
DOI: 10.1145/1273340.1273341

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 by Transpositions

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

A simpler and faster 1.5-approximation a

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

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

Sorting by reversals, block interchanges

Sorting by reversals, block interchanges, tandem duplications, and deletions

✍ Martin Bader 📂 Article 📅 2009 🏛 BioMed Central 🌐 English ⚖ 320 KB

Sorting by Transpositions Is Difficult

✍ Bulteau, Laurent; Fertin, Guillaume; Rusu, Irena 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 467 KB

Sorting by reversals and block-interchan

Sorting by reversals and block-interchanges with various weight assignments

✍ Ying Chih Lin; Chun-Yuan Lin; Chunhung Richard Lin 📂 Article 📅 2009 🏛 BioMed Central 🌐 English ⚖ 781 KB