Sorting genomes by prefix double-cut-and-joins

DOI10.1007/978-3-031-20643-6_13zbMath1529.92034arXiv2208.14315MaRDI QIDQ6111585

Géraldine Jean, Anthony Labarre, Guillaume Fertin

Publication date: 4 August 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.14315

zbMATH Keywords

lower boundsapproximation algorithmsFPTalgorithmicsprefix reversalsgenome rearrangementsprefix DCJs

Mathematics Subject Classification ID

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

Cites Work

• Polynomial-time sortable stacks of burnt pancakes
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• On sorting unsigned permutations by double-cut-and-joins
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Genome Rearrangements and Sorting by Reversals
• Sorting by prefix block-interchanges
• Unnamed Item
• Unnamed Item

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