Rearrangement Distance Problems: An updated survey

Página do item simplificado
dc.contributor.authorOliveira A.R.
dc.contributor.authorBrito K.L.
dc.contributor.authorAlexandrino A.O.
dc.contributor.authorSiqueira G.
dc.contributor.authorDias U.
dc.contributor.authorDias Z.
dc.date.accessioned2024-06-01T06:11:13Z
dc.date.available2024-06-01T06:11:13Z
dc.date.issued2024
dc.description.abstract© 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.One of the challenges in the Comparative Genomics field is to infer how close two organisms are based on the similarities and differences between their genetic materials. Recent advances in DNA sequencing have made complete genomes increasingly available. That said, several new algorithms trying to infer the distance between two organisms based on genome rearrangements have been proposed in the literature. However, given the diversity of approaches, the diversity of genome rearrangement events, or even how each work models the genomes and what assumptions are made by each of them, finding the ideal algorithm for each situation or simply knowing the range of applicable approaches can be challenging. In this work, we review these approaches having the algorithmic and combinatorial advances since 2010 as our main focus. This survey aims to organize the recently published papers using a concise notation and to indicate the gaps filled by each of them in the literature. This makes it easier to understand what still needs to be done and what has room for enhancement.
dc.description.issuenumber8
dc.description.volume56
dc.identifier.doi10.1145/3653295
dc.identifier.issnNone
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/38728
dc.relation.ispartofACM Computing Surveys
dc.rightsAcesso Aberto
dc.subject.otherlanguageapproximation algorithms
dc.subject.otherlanguagecomparative genomics
dc.subject.otherlanguageGenome rearrangements
dc.subject.otherlanguagesorting permutations
dc.titleRearrangement Distance Problems: An updated survey
dc.typeArtigo
local.scopus.citations2
local.scopus.eid2-s2.0-85192835018
local.scopus.subjectAlgorithmics
local.scopus.subjectComparative genomics
local.scopus.subjectComplete genomes
local.scopus.subjectDNA Sequencing
local.scopus.subjectGenetic materials
local.scopus.subjectGenome rearrangements
local.scopus.subjectSorting permutations
local.scopus.updated2025-04-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85192835018&origin=inward
Arquivos
Coleções
Artigos de periódico