Algorithms – ESA 2005
From MaRDI portal
Publication:5475852
DOI10.1007/11561071zbMath1162.68411OpenAlexW2501059503MaRDI QIDQ5475852
Simon W. Ginzinger, Johannes Fischer
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Related Items (9)
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets ⋮ Polynomial-time sortable stacks of burnt pancakes ⋮ Sorting by prefix reversals and prefix transpositions ⋮ Pancake flipping and sorting permutations ⋮ Pancake flipping is hard ⋮ Approximation algorithms for sorting by length-weighted prefix and suffix operations ⋮ Sorting permutations and binary strings by length-weighted rearrangements ⋮ Some relations on prefix reversal generators of the symmetric and hyperoctahedral group ⋮ An Audit Tool for Genome Rearrangement Algorithms
This page was built for publication: Algorithms – ESA 2005
