Weighted Minimum-Length Rearrangement Scenarios.

DOI10.4230/LIPICS.WABI.2019.13MaRDI QIDQ5091737zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Minimum-weight combinatorial structures under random cost-constraints
• Approximation algorithms for sorting permutations by length-weighted short rearrangements
• Weighted shortest common supersequence
• The Least Weight Subsequence Problem
• Improved bounds on sorting by length-weighted reversals
• Linear algorithm for minimal rearrangement of structures
• Open problems and conjectures, optimal rearrangement problems related to discrete loaded strings
• Length-weighted \(\lambda\)-rearrangement distance
• Improved bounds on sorting with length-weighted reversals
• Sorting permutations and binary strings by length-weighted rearrangements

Cites work

• A degree sequence problem related to network design
• Approximating the number of double cut-and-join scenarios
• Configuring random graph models with fixed degree sequences
• Genome Rearrangements and Sorting by Reversals
• On Stokes sets.
• Sorting of Permutations by Cost-Constrained Transpositions
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• String rearrangement metrics: a survey

Cited in

(3)

• Approximating the number of double cut-and-join scenarios
• Models and algorithms for genome rearrangement with positional constraints
• On weighting schemes for gene order analysis

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

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