Approximation algorithms for sorting by \(k\)-cuts on signed permutations
type: Item
instance of: scholarly article
title: Approximation algorithms for sorting by \(k\)-cuts on signed permutations
author: Andre Oliveira
author: Alexsandro Oliveira Alexandrino
author: Géraldine Jean
author: Guillaume Fertin
author: Ulisses Dias
author: Zanoni Dias
published in: Journal of Combinatorial Optimization
publication date: 2022-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7622514
zbMATH Keywords: genome rearrangements
zbMATH Keywords: sorting permutations
zbMATH Keywords: approximation algorithms
zbMATH Keywords: algorithmic complexity
MaRDI profile type: Publication
full work available at URL: s10878-022-00937-z
OpenAlex ID: W4309236104
cites work: Multi-break rearrangements and chromosomal evolution
cites work: Sorting by Transpositions
cites work: Sorting by multi-cut rearrangements
cites work: Sorting by Transpositions Is Difficult
cites work: Sorting permutations by block-interchanges
cites work: Q3393448
cites work: Transforming cabbage into turnip
cites work: Signed genome rearrangement by reversals and transpositions: Models and approximations
cites work: Sorting by \(k\)-cuts on signed permutations
DOI: 10.1007/S10878-022-00937-Z
description: scientific article; zbMATH DE number 7622514