Sorting permutations by limited-size operations

DOI10.1007/978-3-319-91938-6_7MaRDI QIDQ1660120zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cited in

(7)

• Approximation algorithms for sorting permutations by fragmentation-weighted operations
• scientific article; zbMATH DE number 4110087 (Why is no real title available?)
• scientific article; zbMATH DE number 7286740 (Why is no real title available?)
• Approximation algorithms for sorting permutations by length-weighted short rearrangements
• Fast Sorting and Pattern-Avoiding Permutations
• Sorting of Permutations by Cost-Constrained Transpositions
• Two permutation classes related to the bubble sort operator

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)