Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions

DOI10.1007/11732990_46zbMath1302.92062OpenAlexW1989745732MaRDI QIDQ3596318

Enno Ohlebusch, Martin Bader

Publication date: 30 August 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11732990_46

zbMATH Keywords

transpositionssigned permutationgenome rearrangementsweighted reversals

Mathematics Subject Classification ID

Problems related to evolution (92D15) Genetics and epigenetics (92D10)

Related Items (4)

A new algebraic approach to genome rearrangement models ⋮ Multi-break rearrangements and chromosomal evolution ⋮ Maximum likelihood estimates of rearrangement distance: implementing a representation-theoretic approach ⋮ The Emperor Has No Caps! A Comparison of DCJ and Algebraic Distances

This page was built for publication: Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions