A more efficient algorithm for perfect sorting by reversals
type: Item
instance of: scholarly article
title: A more efficient algorithm for perfect sorting by reversals
zbMATH Open document ID: 1186.68143
author: Sèverine Bérard
author: Cedric Chauve
author: Christophe Paul
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5694913
zbMATH Keywords: algorithms
zbMATH Keywords: sorting by reversals
zbMATH Keywords: common intervals
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.10.012
OpenAlex ID: W2088853706
cites work: Algorithms – ESA 2005
cites work: Algorithms and Computation
cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions
cites work: Average-Case Analysis of Perfect Sorting by Reversals
cites work: Q4393480
cites work: Q4679085
cites work: Advances on sorting by reversals
DOI: 10.1016/J.IPL.2007.10.012
description: scientific article; zbMATH DE number 5694913