A new approximation algorithm for sorting of signed permutations
type: Item
instance of: scholarly article
title: A new approximation algorithm for sorting of signed permutations
zbMATH Open document ID: 1025.68028
DOI: 10.1007/BF02946661
author: Yong He
author: Ting Chen
published in: Journal of Computer Science and Technology
publication date: 2003-08-13T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1963352
zbMATH Keywords: combinatorial optimization problem
zbMATH Keywords: sorting permutations
MaRDI profile type: Publication
cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
cites work: Genome Rearrangements and Sorting by Reversals
cites work: Sorting by Transpositions
cites work: Transforming cabbage into turnip
cites work: A 2-approximation algorithm for genome rearrangements by reversals and transpositions
cites work: Signed genome rearrangement by reversals and transpositions: Models and approximations
full work available at URL: https://doi.org/10.1007/bf02946661
OpenAlex ID: W2008547910
description: scientific article; zbMATH DE number 1963352