Finding local genome rearrangements.

Conclusions: A new variant of the weighted DCJ distance problem is addressed that ignores scenario length in its objective function. A solution to this problem provides a lower bound on the number of unlikely moves necessary when transforming one gene order into another. This lower bound aids in the study of rearrangement scenarios with respect to chromatin structure, and could eventually be used in the design of a fixed parameter algorithm with a more general objective function. PMID: 29755580 [PubMed]

https://www.ncbi.nlm.nih.gov/pubmed/29755580?dopt=Abstract

Source: Algorithms for Molecular Biology : AMB - May 16, 2018 Category: Molecular Biology Authors: Simonaitis P, Swenson KM Tags: Algorithms Mol Biol Source Type: research