Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
A barrier for further approximating Sorting By Transpositions
Luiz Augusto G. da Silva, Luis Antonio B. Kowada, Maria Emília M. T. Walter
The Transposition Distance Problem (TDP) is a classical problem in genome rearrangements which seeks to determine the minimum number of transpositions needed to transform a linear…
cs.DS2020
A new 1.375-approximation algorithm for Sorting By Transpositions
L. A. G. Silva, L. A. B. Kowada, N. R. Rocco +1
In genome rearrangements, the mutational event transposition swaps two adjacent blocks of genes in one chromosome. The Transposition Distance Problem (TDP) aims to find the minimum…