Maximum Alternating Balanced Cycle Decomposition and Applications in Sorting by Intergenic Operations Problems

Página do item simplificado
dc.contributor.authorBrito K.L.
dc.contributor.authorAlexandrino A.O.
dc.contributor.authorSiqueira G.
dc.contributor.authorOliveira A.R.
dc.contributor.authorDias U.
dc.contributor.authorDias Z.
dc.date.accessioned2024-06-01T06:12:10Z
dc.date.available2024-06-01T06:12:10Z
dc.date.issued2024
dc.description.abstract© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.In the literature on genome rearrangement, several approaches use different structures to improve the results of genome rearrangement problems. In particular, graphs are structures widely used for the purpose of representing information retrieved from genomes. The breakpoint graph is a useful tool in this area because it allows representing in the same structure the gene orders of two genomes being compared. The maximum cycle decomposition of this graph brings immediate gain for deriving lower bounds for various genome rearrangement problems. This paper introduces a generalization of the Maximum Alternating Cycle Decomposition problem (MAX-ACD), called the Maximum Alternating Balanced Cycle Decomposition problem (MAX-ABCD). The MAX-ACD problem is closely related to the Sorting by Reversals problem and is a relevant topic of investigation in mathematics. The MAX-ABCD problem has applications in the Sorting by Intergenic Reversals problem, which is a problem that takes into account both the gene order and the information present in the intergenic regions. We present an algorithm with a constant approximation factor for the MAX-ABCD problem. Furthermore, we design an improved algorithm for the Sorting by Intergenic Operations of Reversal and Indel problem that guarantees an approximation factor of 32 considering a scenario where the orientation of the genes is known. For the scenario where the orientation of the genes is unknown and based on an algorithm for the MAX-ABCD problem, we develop approximation algorithms for the Sorting by Intergenic Reversals and Sorting by Intergenic Operations of Reversal and Indel problems with an approximation factor of 2k, where k=3121+ϵ.
dc.description.firstpage153
dc.description.lastpage172
dc.description.volume14616 LNBI
dc.identifier.doi10.1007/978-3-031-58072-7_8
dc.identifier.issnNone
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/38743
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsAcesso Restrito
dc.subject.otherlanguageApproximation Algorithm
dc.subject.otherlanguageCycle Decomposition
dc.subject.otherlanguageReversal
dc.titleMaximum Alternating Balanced Cycle Decomposition and Applications in Sorting by Intergenic Operations Problems
dc.typeArtigo de evento
local.scopus.citations0
local.scopus.eid2-s2.0-85192267489
local.scopus.subjectApproximation factor
local.scopus.subjectCycle decompositions
local.scopus.subjectDecomposition problems
local.scopus.subjectDifferent structure
local.scopus.subjectGene orders
local.scopus.subjectGenome rearrangements
local.scopus.subjectMaximum alternating cycle decomposition
local.scopus.subjectOperation problem
local.scopus.subjectReversal
local.scopus.subjectReversal problems
local.scopus.updated2025-04-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85192267489&origin=inward
Arquivos
Coleções
Artigos de periódico