On sorting unsigned permutations by double-cut-and-joins

DOI10.1007/s10878-010-9369-8zbMath1267.90067OpenAlexW2003985385MaRDI QIDQ2377380

Xin Chen

Publication date: 28 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9369-8

zbMATH Keywords

genome rearrangementfractional linear programmingbreakpoint graph decompositiondouble-cut-and-joins

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32) Linear programming (90C05)

Related Items

A new approach for the reversal distance with indels and moves in intergenic regions ⋮ Sorting by prefix block-interchanges ⋮ Sorting genomes by prefix double-cut-and-joins ⋮ Unnamed Item ⋮ Approximation algorithms for sorting by length-weighted prefix and suffix operations ⋮ Length-weighted \(\lambda\)-rearrangement distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved approximation for breakpoint graph decomposition and sorting by reversals
• A further improved approximation algorithm for breakpoint graph decomposition
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Genome Rearrangements and Sorting by Reversals
• Reducibility among Combinatorial Problems
• Vector-valued wavelets with triangular support for method of moments applications