Sorting separable permutations by restricted multi-break rearrangements

DOI10.21711/231766362015/RMC4412MaRDI QIDQ6489449zbMATH OpenFDO

Authors Luís Felipe Ignácio Cunha, Luis Antonio B. Kowada, Celina M. H. de Figueiredo

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

zbMATH Keywords

algorithmscographssorting permutationsgenome rearrangements

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Sorting by \(k\)-cuts on signed permutations
• Approximation algorithms for sorting by \(k\)-cuts on signed permutations
• Sorting by multi-cut rearrangements
• Multi-break rearrangements and chromosomal evolution
• Permutation patterns in genome rearrangement problems

This page was built for publication: Sorting separable permutations by restricted multi-break rearrangements

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