TY  - JOUR
AB  - Background

Rearrangements are large-scale mutations in genomes, responsible for complex changes and structural variations. Most rearrangements that modify the organization of a genome can be represented by the double cut and join (DCJ) operation. Given two balanced genomes, i.e., two genomes that have exactly the same number of occurrences of each gene in each genome, we are interested in the problem of computing the rearrangement distance between them, i.e., finding the minimum number of DCJ operations that transform one genome into the other. This problem is known to be NP-hard.
Results

We propose a linear time approximation algorithm with approximation factor O(k) for the DCJ distance problem, where k is the maximum number of occurrences of any gene in the input genomes. Our algorithm works for linear and circular unichromosomal balanced genomes and uses as an intermediate step an O(k)-approximation for the minimum common string partition problem, which is closely related to the DCJ distance problem.
Conclusions

Experiments on simulated data sets show that our approximation algorithm is very competitive both in efficiency and in quality of the solutions.
DA  - 2017
DO  - 10.1186/s13015-017-0095-y
KW  - Double cut and join (DCJ)
KW  - Genome rearrangements
KW  - Comparative genomics
KW  - Approximation algorithms
LA  - eng
IS  - 1
PY  - 2017
SN  - 1748-7188
T2  - Algorithms for Molecular Biology
TI  - Approximating the DCJ distance of balanced genomes in linear time
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-29090571
Y2  - 2024-11-22T01:46:46
ER  -