A New and Faster Method of Sorting by Transpositions

DOI10.1007/978-3-540-73437-6_15MaRDI QIDQ3506916zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Maxime Benoît-Gagné, Sylvie Hamel

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_15

zbMATH Keywords

Genome rearrangementpermutationtransposition distance

Mathematics Subject Classification ID

Searching and sorting (68P10) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• A simpler and faster 1.5-approximation algorithm for sorting by transpositions
• Theory and Applications of Models of Computation
• Faster algorithms for sorting by transpositions and sorting by block interchanges
• A simpler 1.5-approximation algorithm for sorting by transpositions
• An approximation algorithm for sorting by reversals and transpositions
• Research in Computational Molecular Biology
• Sorting by Transpositions

Cited in

(6)

• Implementation of bubble sort and the odd-even transposition sort on a rack of transputers
• Sorting permutations with transpositions in \(O(n^3)\) amortized time
• Replacement sort revisited: The ``gold standard unearthed!
• An audit tool for genome rearrangement algorithms
• Fast Sorting and Pattern-Avoiding Permutations
• Transposition rearrangement: linear algorithm for length-cost model

This page was built for publication: A New and Faster Method of Sorting by Transpositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506916)