Finding Local Genome Rearrangements

DOI10.4230/LIPICS.WABI.2017.24MaRDI QIDQ5111832zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Genome Rearrangements and Sorting by Reversals
• Sorting genomes by generalized translocations
• Genome rearrangements with gene families
• scientific article; zbMATH DE number 1615283
• Genome rearrangements on both gene order and intergenic regions
• Localization of genes
• scientific article; zbMATH DE number 1405847

Cites work

• Improved bounds on sorting by length-weighted reversals
• Models and algorithms for genome rearrangement with positional constraints
• Packing cycles in undirected graphs
• The NP-Completeness of Some Edge-Partition Problems

Cited in

(9)

• Identifying regions of a gene that are susceptible to mutation
• Localization of genes
• A maximum parsimony principle for multichromosomal complex genome rearrangements
• Models and algorithms for genome rearrangement with positional constraints
• Approximating the number of double cut-and-join scenarios
• Linearizing genomes: exact methods and local search
• Distribution of genome rearrangement distance under double cut and join
• A linear time approximation algorithm for the DCJ distance for genomes with bounded number of duplicates
• Outerplanar graph data structure: a new computational analysis model of genome rearrangements

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)