title: Double cut and join with insertions and deletions.
abstract: Many approaches to compute the genomic distance are still limited to genomes with the same content, without duplicated markers. However, differences in the gene content are frequently observed and can reflect important evolutionary aspects. While duplicated markers can hardly be handled by exact models, when duplicated markers are not allowed, a few polynomial time algorithms that include genome rearrangements, insertions and deletions were already proposed. In an attempt to improve these results, in the present work we give the first linear time algorithm to compute the distance between two multichromosomal genomes with unequal content, but without duplicated markers, considering insertions, deletions and double cut and join (DCJ) operations. We derive from this approach algorithms to sort one genome into another one also using DCJ operations, insertions and deletions. The optimal sorting scenarios can have different compositions and we compare two types of sorting scenarios: one that maximizes and one that minimizes the number of DCJ operations with respect to the number of insertions and deletions. We also show that, although the triangle inequality can be disrupted in the proposed genomic distance, it is possible to correct this problem adopting a surcharge on the number of non-common markers. We use our method to analyze six species of Rickettsia, a group of obligate intracellular parasites, and identify preliminary evidence of clusters of deletions.
authors: Technische Fakultät, Universität Bielefeld, Bielefeld, Germany. mdbraga@inmetro.gov.br
authors: Marília D V
authors: MD
authors: Braga
authors: Eyla
authors: E
authors: Willing
authors: Jens
authors: J
authors: Stoye
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D019143:Evolution, Molecular; D016680:Genome, Bacterial; D054643:INDEL Mutation; D008957:Models, Genetic; D010802:Phylogeny; D011995:Recombination, Genetic; D012281:Rickettsia / Q000235:genetics*