An efficient algorithm for one-sided block ordering problem under block-interchange distance

DOI10.1016/J.TCS.2015.10.010zbMath1331.68282OpenAlexW2121392842MaRDI QIDQ897897

Chin Lung Lu, Chi-Long Li, Kun-Tze Chen, Hsien-Tai Chiu

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

zbMATH Keywords

algorithmcomputational biologyblock-interchangeone-sided block ordering problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Uses Software

• CAR

Cites Work

• Unnamed Item
• Unnamed Item
• Revisiting the minimum breakpoint linearization problem
• Sorting permutations by block-interchanges
• Advances on sorting by reversals
• An improved algorithm for sorting by block-interchanges based on permutation groups
• Sorting by Transpositions Is Difficult
• Transforming cabbage into turnip
• Sorting by Transpositions
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Polynomial-time algorithm for computing translocation distance between genomes

This page was built for publication: An efficient algorithm for one-sided block ordering problem under block-interchange distance