An improved algorithm for sorting by block-interchanges based on permutation groups
From MaRDI portal
Publication:991802
DOI10.1016/J.IPL.2010.03.003zbMATH Open1213.68418OpenAlexW1984048611MaRDI QIDQ991802FDOQ991802
Cheng-Chen Huang, Chin Lung Lu, Yen-Lin Huang, Chuan Yi Tang
Publication date: 7 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.03.003
Recommendations
algorithmdata structurepermutation groupgenome rearrangementgeneralized transpositionpermutation treeblock-interchange
Cites Work
- Sorting by Transpositions
- Transforming cabbage into turnip
- Title not available (Why is that?)
- An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations
- Polynomial-time algorithm for computing translocation distance between genomes
- Advances on sorting by reversals
- Faster algorithms for sorting by transpositions and sorting by block interchanges
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Title not available (Why is that?)
- Sorting permutations by block-interchanges
- The average number of block interchanges needed to sort a permutation and a recent result of Stanley
Cited In (6)
- An improved block-interchange algorithm
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
- An efficient algorithm for one-sided block ordering problem under block-interchange distance
- Rearrangement events on circular genomes
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
- Plane permutations and applications to a result of Zagier-Stanley and distances of permutations
This page was built for publication: An improved algorithm for sorting by block-interchanges based on permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991802)
