Sorting signed permutations by reversals in nearly-linear time

DOI10.1137/1.9781611977936.19MaRDI QIDQ6545115zbMATH OpenFDO

Authors Bartłomiej Dudek, Paweł Gawrychowski, Tatiana Starikovskaya

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977936.19

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Improved approximation algorithm and hardness result for sorting unsigned strings by symmetric reversals

This page was built for publication: Sorting signed permutations by reversals in nearly-linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545115)