\((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.
type: Item
instance of: scholarly article
title: \((1+\varepsilon)\)-approximation of sorting by reversals and transpositions.
zbMATH Open document ID: 1061.68038
DOI: 10.1016/S0304-3975(01)00338-3
author: Niklas Eriksen
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 1857077
zbMATH Keywords: Permutations
zbMATH Keywords: Sorting
zbMATH Keywords: Genome rearrangements
zbMATH Keywords: Reversals
zbMATH Keywords: Transpositions
zbMATH Keywords: Approximation algorithm
MaRDI profile type: Publication
cites work: Genome Rearrangements and Sorting by Reversals
cites work: Sorting by Transpositions
cites work: Q4547739
cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions
cites work: A 2-approximation algorithm for genome rearrangements by reversals and transpositions
cites work: Q4234063
cites work: Q5501812
Recommended article: (1+ε)-Approximation of Sorting by Reversals and Transpositions
Recommended article: An approximation algorithm for sorting by reversals and transpositions
Recommended article: Q4411359
Recommended article: Q4250188
Recommended article: A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
Recommended article: A simpler and faster 1.5-approximation algorithm for sorting by transpositions
description: scientific article; zbMATH DE number 1857077