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

DOI10.1016/J.TCS.2015.10.010MaRDI QIDQ897897zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmcomputational biologyblock-interchangeone-sided block ordering problem

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1306890 (Why is no real title available?)
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Advances on sorting by reversals
• An improved algorithm for sorting by block-interchanges based on permutation groups
• Combinatorics of genome rearrangements.
• Polynomial-time algorithm for computing translocation distance between genomes
• Revisiting the minimum breakpoint linearization problem
• Sorting by Transpositions
• Sorting permutations by block-interchanges
• Transforming cabbage into turnip

Cited in

(1)

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

Describes a project that uses

Uses Software

• CAR

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)