Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

Median Approximations for Genomes Modeled as Matrices

Texto completo
Autor(es):
Pereira Zanetti, Joao Paulo [1] ; Biller, Priscila [1] ; Meidanis, Joao [1, 2]
Número total de Autores: 3
Afiliação do(s) autor(es):
[1] Univ Estadual Campinas, Inst Comp, Campinas, SP - Brazil
[2] Scylla Bioinformat, Campinas, SP - Brazil
Número total de Afiliações: 2
Tipo de documento: Artigo Científico
Fonte: Bulletin of Mathematical Biology; v. 78, n. 4, p. 786-814, APR 2016.
Citações Web of Science: 3
Resumo

The genome median problem is an important problem in phylogenetic reconstruction under rearrangement models. It can be stated as follows: Given three genomes, find a fourth that minimizes the sum of the pairwise rearrangement distances between it and the three input genomes. In this paper, we model genomes as matrices and study the matrix median problem using the rank distance. It is known that, for any metric distance, at least one of the corners is a 4/3-approximation of the median. Our results allow us to compute up to three additional matrix median candidates, all of them with approximation ratios at least as good as the best corner, when the input matrices come from genomes. We also show a class of instances where our candidates are optimal. From the application point of view, it is usually more interesting to locate medians farther from the corners, and therefore, these new candidates are potentially more useful. In addition to the approximation algorithm, we suggest a heuristic to get a genome from an arbitrary square matrix. This is useful to translate the results of our median approximation algorithm back to genomes, and it has good results in our tests. To assess the relevance of our approach in the biological context, we ran simulated evolution tests and compared our solutions to those of an exact DCJ median solver. The results show that our method is capable of producing very good candidates. (AU)

Processo FAPESP: 12/14104-0 - Problemas de Rearranjo de Genomas Vistos Através de Permutações, Matrizes e Outros Conceitos de Álgebra
Beneficiário:Priscila Do Nascimento Biller
Modalidade de apoio: Bolsas no Brasil - Doutorado
Processo FAPESP: 12/13865-7 - Modelo Algébrico de Rearranjo de Genomas
Beneficiário:João Paulo Pereira Zanetti
Modalidade de apoio: Bolsas no Brasil - Doutorado