Busca avançada
Ano de início
Entree


Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information

Texto completo
Autor(es):
Alexandrino, Alexsandro Oliveira ; Oliveira, Andre Rodrigues ; Jean, Geraldine ; Fertin, Guillaume ; Dias, Ulisses ; Dias, Zanoni
Número total de Autores: 6
Tipo de documento: Artigo Científico
Fonte: JOURNAL OF COMPUTATIONAL BIOLOGY; v. 30, n. 8, p. 16-pg., 2023-05-24.
Resumo

The most common way to calculate the rearrangement distance between two genomes is to use the size of a minimum length sequence of rearrangements that transforms one of the two given genomes into the other, where the genomes are represented as permutations using only their gene order, based on the assumption that genomes have the same gene content. With the advance of research in genome rearrangements, new works extended the classical models by either considering genomes with different gene content (unbalanced genomes) or including more genomic characteristics to the mathematical representation of the genomes, such as the distribution of intergenic regions sizes. In this study, we study the Reversal, Transposition, and Indel (Insertion and Deletion) Distance using intergenic information, which allows comparing unbalanced genomes, because indels are included in the rearrangement model (i.e., the set of possible rearrangements allowed when we compute the distance). For the particular case of transpositions and indels on unbalanced genomes, we present a 4-approximation algorithm, improving a previous 4.5 approximation. This algorithm is extended so as to deal with gene orientation and to maintain the 4-approximation factor for the Reversal, Transposition, and Indel Distance on unbalanced genomes. Furthermore, we evaluate the proposed algorithms using experiments on simulated data. (AU)

Processo FAPESP: 13/08293-7 - CECC - Centro de Engenharia e Ciências Computacionais
Beneficiário:Munir Salomao Skaf
Modalidade de apoio: Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs
Processo FAPESP: 19/27331-3 - Problemas de ordenação por rearranjos de genomas
Beneficiário:André Rodrigues Oliveira
Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado
Processo FAPESP: 15/11937-9 - Investigação de problemas difíceis do ponto de vista algorítmico e estrutural
Beneficiário:Flávio Keidi Miyazawa
Modalidade de apoio: Auxílio à Pesquisa - Temático