Sorting circular binary strings with length weighted transpositions

MaRDI QIDQ3611082zbMATH OpenFDO

Authors Xingqin Qi, Jing Cao, Chen Zhang

Publication date 6 March 2009

zbMATH Keywords

approximation algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Discrete mathematics in relation to computer science (68R99) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• Improved bounds on sorting by length-weighted reversals
• Combinatorial Pattern Matching
• Improved bounds on sorting with length-weighted reversals
• Sorting permutations and binary strings by length-weighted rearrangements
• Approximation algorithms for sorting by length-weighted prefix and suffix operations

Cited in

(4)

• scientific article; zbMATH DE number 5124574 (Why is no real title available?)
• Combinatorial Pattern Matching
• On the cost of interchange rearrangement in strings
• Improved bounds on sorting by length-weighted reversals

This page was built for publication: Sorting circular binary strings with length weighted transpositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611082)