A New and Faster Method of Sorting by Transpositions

DOI10.1007/978-3-540-73437-6_15zbMath1138.92323DBLPconf/cpm/Benoit-GagneH07OpenAlexW1600987055WikidataQ60704261 ScholiaQ60704261MaRDI QIDQ3506916

Sylvie Hamel, Maxime Benoît-Gagné

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

permutationtransposition distanceGenome rearrangement

Mathematics Subject Classification ID

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

Related Items (3)

Sorting permutations with transpositions in \(O(n^3)\) amortized time ⋮ Sorting by Transpositions Is Difficult ⋮ An Audit Tool for Genome Rearrangement Algorithms

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