Sorting genomes by prefix double-cut-and-joins

DOI10.1016/j.tcs.2024.114909MaRDI QIDQ6652451

Anthony Labarre, Géraldine Jean, Guillaume Fertin

Publication date: 12 December 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

lower boundsapproximation algorithmsalgorithmicsprefix reversalsgenome rearrangementsprefix DCJs

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Approximation algorithms (68W25) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pancake flipping is hard
• Polynomial-time sortable stacks of burnt pancakes
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Combinatorics of Permutations
• Transforming cabbage into turnip
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• A degree sequence problem related to network design
• Genome Rearrangements and Sorting by Reversals
• Sorting by prefix block-interchanges

This page was built for publication: Sorting genomes by prefix double-cut-and-joins