Block Interchange and Reversal Distance on Unbalanced Genomes

Página do item simplificado
dc.contributor.authorAlexandrino A.O.
dc.contributor.authorSiqueira G.
dc.contributor.authorBrito K.L.
dc.contributor.authorOliveira A.R.
dc.contributor.authorDias U.
dc.contributor.authorDias Z.
dc.date.accessioned2024-03-12T19:11:20Z
dc.date.available2024-03-12T19:11:20Z
dc.date.issued2023
dc.description.abstract© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.One method for inferring the evolutionary distance between two organisms is to find the rearrangement distance, which is defined as the minimum number of genome rearrangements required to transform one genome into the other. Rearrangements that do not alter the genome content are known as conservative. Examples of such rearrangements include: reversal, which reverts a segment of the genome; transposition, which exchanges two consecutive blocks; block interchange (BI), which exchanges two blocks at any position in the genome; and double cut and join (DCJ), which cuts two different pairs of adjacent blocks and joins them in a different manner. Initially, works in this area involved comparing genomes that shared the same set of conserved blocks. Nowadays, researchers are investigating unbalanced genomes (genomes with a distinct set of genes), which requires the use of non-conservative rearrangements such as insertions and deletions (indels). In cases where there are no repeated blocks and the genomes have the same set of blocks, the BI Distance and the Reversal Distance have polynomial-time algorithms, while the complexity of the BI and Reversal Distance problem remains unknown. In this study, we investigate the BI and Indel Distance and the BI, Reversal, and Indel Distance on genomes with different gene content and no repeated genes. We present 2-approximation algorithms for each problem using a variant of the breakpoint graph structure.
dc.description.firstpage1
dc.description.lastpage13
dc.description.volume13954 LNBI
dc.identifier.doi10.1007/978-3-031-42715-2_1
dc.identifier.issn1611-3349
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/34169
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsAcesso Restrito
dc.subject.otherlanguageBlock Interchange
dc.subject.otherlanguageReversal
dc.subject.otherlanguageUnbalanced Genomes
dc.titleBlock Interchange and Reversal Distance on Unbalanced Genomes
dc.typeArtigo de evento
local.scopus.citations0
local.scopus.eid2-s2.0-85172230269
local.scopus.subjectAND joins
local.scopus.subjectBlock interchange
local.scopus.subjectDouble cut and joins
local.scopus.subjectEvolutionary distance
local.scopus.subjectGenome rearrangements
local.scopus.subjectInsertions and deletions
local.scopus.subjectPolynomial-time algorithms
local.scopus.subjectReversal
local.scopus.subjectReversal distance
local.scopus.subjectUnbalanced genome
local.scopus.updated2024-12-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85172230269&origin=inward
Arquivos
Coleções
Artigo de evento