| dc.creator | Zanetti | |
| dc.creator | JPP; Biller | |
| dc.creator | P; Meidanis | |
| dc.creator | J | |
| dc.date | 2016 | |
| dc.date | 2016-12-06T18:29:41Z | |
| dc.date | 2016-12-06T18:29:41Z | |
| dc.date.accessioned | 2018-03-29T02:02:11Z | |
| dc.date.available | 2018-03-29T02:02:11Z | |
| dc.identifier | 1522-9602 | |
| dc.identifier | Bulletin Of Mathematical Biology. SPRINGER, n. 78, n. 4, p. 786 - 814. | |
| dc.identifier | 1522-9602 | |
| dc.identifier | WOS:000375419200007 | |
| dc.identifier | 10.1007/s11538-016-0162-4 | |
| dc.identifier | http://link-springer-com.ez88.periodicos.capes.gov.br/article/10.1007%2Fs11538-016-0162-4 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/319833 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1310599 | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | 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. | |
| dc.description | 78 | |
| dc.description | | |
| dc.description | 786 | |
| dc.description | 814 | |
| dc.description | FAPESP (Brazil) [2012/13865-7, 2012/14104-0] | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | | |
| dc.description | | |
| dc.description | | |
| dc.language | English | |
| dc.publisher | SPRINGER | |
| dc.publisher | NEW YORK | |
| dc.relation | Bulletin Of Mathematical Biology | |
| dc.rights | fechado | |
| dc.source | WOS | |
| dc.subject | Phylogenetic Reconstruction | |
| dc.subject | Genome Median Problem | |
| dc.subject | Approximated Algorithms | |
| dc.subject | Subspace Decomposition | |
| dc.title | Median Approximations For Genomes Modeled As Matrices | |
| dc.type | Artículos de revistas | |
