Approximation algorithms for sorting permutations by fragmentation-weighted operations
type: Item
instance of: scholarly article
title: Approximation algorithms for sorting permutations by fragmentation-weighted operations
zbMATH Open document ID: 1392.92056
DOI: 10.1007/978-3-319-91938-6_5
author: Alexsandro Oliveira Alexandrino
author: Carla Negri Lintzmayer
author: Zanoni Dias
publication date: 2018-08-15T00:00:00Z
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 92D10
zbMATH DE Number: 6918641
zbMATH Keywords: genome rearrangements
zbMATH Keywords: sorting permutations
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: 978-3-319-91938-6 5
OpenAlex ID: W2803410972
Recommended article: Approximation algorithms for sorting permutations by length-weighted short rearrangements
Recommended article: Approximation algorithms for sorting permutations by extreme block-interchanges
Recommended article: Approximation algorithms for sorting by length-weighted prefix and suffix operations
Recommended article: Approximation algorithms for sorting by \(k\)-cuts on signed permutations
Recommended article: A new approximation algorithm for sorting of signed permutations
Recommended article: Sorting permutations by limited-size operations
Recommended article: An approximation algorithm for sorting by reversals and transpositions
Recommended article: Q4815956
Recommended article: Sorting of Permutations by Cost-Constrained Transpositions
description: scientific article; zbMATH DE number 6918641