Weighted Minimum-Length Rearrangement Scenarios.

DOI10.4230/LIPIcs.WABI.2019.13zbMath1495.92042OpenAlexW2979014257MaRDI QIDQ5091737

Pijus Simonaitis, Annie Chateau, Krister M. Swenson

Publication date: 27 July 2022

Full work available at URL: https://doi.org/10.4230/lipics.wabi.2019.13

zbMATH Keywords

double cut and join (DCJ)edge switchminimum-weight quadrangulationweighted genome rearrangement

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Unnamed Item
• Approximating the number of double cut-and-join scenarios
• String Rearrangement Metrics: A Survey
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• A degree sequence problem related to network design
• Configuring Random Graph Models with Fixed Degree Sequences
• Genome Rearrangements and Sorting by Reversals
• Sorting of Permutations by Cost-Constrained Transpositions

This page was built for publication: Weighted Minimum-Length Rearrangement Scenarios.