An efficient algorithm for one-sided block ordering problem under block-interchange distance
DOI10.1016/J.TCS.2015.10.010zbMATH Open1331.68282OpenAlexW2121392842MaRDI QIDQ897897FDOQ897897
Authors: Kun-Tze Chen, Chi-Long Li, Hsien-Tai Chiu, Chin Lung Lu 
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.010
Recommendations
- An efficient algorithm for one-sided block ordering problem with block-interchange distance
- An improved algorithm for sorting by block-interchanges based on permutation groups
- Sorting permutations by block-interchanges
- An improved block-interchange algorithm
- scientific article; zbMATH DE number 1342319
Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)
Cites Work
- Combinatorics of genome rearrangements.
- Sorting by Transpositions
- Transforming cabbage into turnip
- Title not available (Why is that?)
- Polynomial-time algorithm for computing translocation distance between genomes
- Advances on sorting by reversals
- Revisiting the minimum breakpoint linearization problem
- Sorting by transpositions is difficult
- A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
- Sorting permutations by block-interchanges
- An improved algorithm for sorting by block-interchanges based on permutation groups
Uses Software
This page was built for publication: An efficient algorithm for one-sided block ordering problem under block-interchange distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897897)
