Finding Local Genome Rearrangements

DOI10.4230/LIPICS.WABI.2017.24zbMATH Open1443.92124OpenAlexW2746222091MaRDI QIDQ5111832FDOQ5111832

Pijus Simonaitis, Krister M. Swenson

Publication date: 27 May 2020

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

zbMATH Keywords

approximation algorithmNP-completegenome rearrangementdouble cut and joinHi-Cmaximum edge-disjoint cycle packing

Mathematics Subject Classification ID

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

Cites Work

• The NP-Completeness of Some Edge-Partition Problems
• Packing cycles in undirected graphs
• Improved bounds on sorting by length-weighted reversals
• Models and Algorithms for Genome Rearrangement with Positional Constraints

Cited In (2)

• Identifying regions of a gene that are susceptible to mutation
• Localization of genes

   Recommendations

• Genome Rearrangements and Sorting by Reversals 👍 👎
• Sorting genomes by generalized translocations 👍 👎
• Genome rearrangements with gene families 👍 👎
• Title not available (Why is that?) 👍 👎
• Genome rearrangements on both gene order and intergenic regions 👍 👎
• Localization of genes 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Finding Local Genome Rearrangements

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