2 papers
cs.DS2024
A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
Krister M. Swenson
In 1937, biologists Sturtevant and Tan posed a computational question: transform a chromosome represented by a permutation of genes, into a second permutation, using a minimum-leng…
cs.DS2018
A framework for cost-constrained genome rearrangement under Double Cut and Join
Pijus Simonaitis, Annie Chateau, Krister M. Swenson
The study of genome rearrangement has many flavours, but they all are somehow tied to edit distances on variations of a multi-graph called the breakpoint graph. We study a weighted…