Sorting permutations by limited-size operations

DOI10.1007/978-3-319-91938-6_7zbMATH Open1392.92061OpenAlexW2803227139MaRDI QIDQ1660120FDOQ1660120

Authors: Guilherme Henrique Santos Miranda, Carla Negri Lintzmayer, Zanoni Dias 

Publication date: 15 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-91938-6_7

Recommendations

• Length-weighted \(\lambda\)-rearrangement distance
• scientific article; zbMATH DE number 1405677
• Genome Rearrangements and Sorting by Reversals
• Publication:4886097
• scientific article; zbMATH DE number 1342319

zbMATH Keywords

computational biologyreversalsgenome rearrangementtranspositionssorting permutations

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Cited In (8)

• Title not available (Why is that?)
• Sorting of Permutations by Cost-Constrained Transpositions
• Two permutation classes related to the bubble sort operator
• Approximation algorithms for sorting permutations by fragmentation-weighted operations
• Sorting with forbidden intermediates
• Approximation algorithms for sorting permutations by length-weighted short rearrangements
• Title not available (Why is that?)
• Fast Sorting and Pattern-Avoiding Permutations

This page was built for publication: Sorting permutations by limited-size operations

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