%0 Journal Article
%T Approximating the DCJ distance of balanced genomes in linear time
%A Diego P. Rubert
%A Jens Stoye
%A Mar¨ªlia Dias Vieira Braga
%A Pedro Feij£¿o
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2017
%R 10.1186/s13015-017-0095-y
%X 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
%K Double cut and join (DCJ)
%K Genome rearrangements
%K Comparative genomics
%K Approximation algorithms
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5345319/